Abstract:

In this paper,we firstly describe several common sorting methods,analyze their merits and shortcomings,and then propose some sorting methods which can determine the final position of at least one element during each trip of sorting.We discuss heapsort algorithm and quicksort algorithm in particular.Through the comparison of these methods,it shows that the quicksort is often better than heapsort when finding out the first several elements among a large number of elements.

Key words: sort；heapsort；quicksort