Heap Sort uses a binary heap to sort an array by building a min heap and repeatedly extracting the minimum element.
Builds a min heap to prioritize smallest elements
In-place sorting algorithm with no extra memory
Not stable but guarantees O(n log n) performance
Efficient for large datasets with heap properties
Heap Sort shines in systems where memory is limited but sorting speed is critical