Heap Sort

O(n log n)

Colour Guide

Sifting / Active Element

Inside Max-Heap

Sorted (Extracted)

Speed

Input

Max 12 elements.

Pseudocode

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

Phase

Ready

Step Log

Complexity

Best	O(n log n)
Worst	O(n log n)
Average	O(n log n)
Space	O(1)