Sorting algorithms/Heapsort: Difference between revisions

{{task|Sorting Algorithms}}{{Sorting Algorithm}}[[wp:Heapsort|Heapsort]] is an in-place sorting algorithm with worst case and average complexity of <span style="font-family: serif">O(''n*log('' log''n''))</span>. The basic idea is to turn the array into a binary heap structure, which has the property that it allows efficient retrieval and removal of the maximal element. We repeatedly "remove" the maximal element from the heap, thus building the sorted list from back to front. See [[wp:Heapsort|Heapsort]] for more details and pseudocode. Heapsort requires random access, so can only be used on an array-like data structure.