Heap Sort is a comparison-based sorting algorithm that builds a binary heap from the input array and repeatedly extracts the maximum element to produce a sorted array.
Paradigm
Comparison / Heap
Author
J.W.J. Williams
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties