Heap sort builds a max heap from the array, then repeatedly swaps the…#613

Open

mhs-m wants to merge 1 commit into

vichitr:masterfrom

Commits on May 27, 2026

Heap sort builds a max heap from the array, then repeatedly swaps the root (largest) with the last unsorted element and heapifies the reduced heap to sort in place with O(n log n) time.
mhs-m
committed