ABSTRACT

Heapsort is a sorting algorithm for floating-point numbers which is fast even in the worst case scenario. It exploits data arrangement and demonstrates that a good algorithm does not have to be straightforward. Hence, several interesting concepts can be learned from it at once.