Heap Sort

O(n log n)

Speed

Max 12 elements.

heapSort(arr): buildMaxHeap(arr) for i from n-1 to 1: swap(arr[0], arr[i]) heapify(arr, 0, i)

Ready

Sifting / Active Element

Inside Max-Heap

Sorted (Extracted)