Heap Sort relies on converting an array into a max-heap and then using heap operations to move one value at a time into its correct location.
Heap Sort sorts an array of n values in Θ(nlog(n)) time.