🔥 heap sort → Heapsort relies on heapify to build the initial heap in O(n) and to restore the heap property after each root extraction, enabling its in-place O(n log n) sorting procedure.

🌟 heapify floyd bottom up →