Jump to content

Sorting algorithms/Heapsort: Difference between revisions

Sorting algorithms/Heapsort (view source)

Revision as of 22:42, 29 July 2020

3 bytes added ,  3 years ago
m
added whitespace.
m (added Category:Sorting)
m (added whitespace.)
Line 12:
We repeatedly "remove" the maximal element from the heap, thus building the sorted list from back to front.
 
HeapsortA heap sort requires random access, so can only be used on an array-like data structure.
 
Pseudocode:
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/120722"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information