How to analyze these two data structure questions?

lztfe527

11, 8 points There are 5000 unordered elements. If you want to quickly select the largest 10 elements, which one is the best among fast, heap, merge, radix, and hill sorting, and why?

12, 10 points n different English words are sorted, the length is m, n >> 50, m <5, which sorting method is the best? why?

And what is a trigeminal heap?

ivor1982

1. Heap, maintain a maximum of 10 numbers with a 10-number heap, time is linear
2. Radix sort

Three forks, as the name suggests, each node has 3 children

aensosny

Big top pile