Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure. It has guaranteed $O(n \log n)$ time complexity and sorts in-place. Algorithm Overview Build Max Heap: Convert array into max heap Extract Max: Repeatedly remove max element and rebuild heap Key Properties Time: $O(n \log n)$ for …