Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
added whitespace before the TOC, added other whitespace in the task's preamble.
(Added Elixir) |
m (added whitespace before the TOC, added other whitespace in the task's preamble.) |
||
Line 1:
{{task|Sorting Algorithms}} {{Sorting Algorithm}} {{wikipedia|Heapsort}}
{{omit from|GUISS}}
[[wp:Heapsort|Heapsort]] is an in-place sorting algorithm with worst case and average complexity of <span style="font-family: serif">O(''n'' log''n'')</span>. ▼
<br>
▲[[wp:Heapsort|Heapsort]] is an in-place sorting algorithm with worst case and average complexity of <span style="font-family: serif">O(''n'' 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.
Heapsort requires random access, so can only be used on an array-like data structure.
Line 51 ⟶ 56:
'''else'''
'''return'''
<br>
Write a function to sort a collection of integers using heapsort.
<br><br>
=={{header|ActionScript}}==
| |||