heapsort
Sort algorithms home
JavaCFORTRANPASCAL
sort
heapsort
Inherits from sort
A sort algorithm which builds a heap, then repeatedly extracts the maximum item. Run time is O(n log n). [National Institute of Standards and Technology]
Demonstrations: http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html
Implementations and sample code: http://www.cs.ubc.ca/spider/harrison/Java/HeapSortAlgorithm.java [Java]
http://www2.hawaii.edu/%7Ecopley/665/HSMain.html [Java]
See also heapsort variants: adaptive heap sort, introspective sort