Heap Sort Visualization & Animation

## Heap Sort Heap Sort uses a binary heap data structure to sort elements. It first builds a max heap, then repeatedly extracts the maximum element. ### How it works: 1. Build a max heap from the input data 2. Extract the maximum element (root) 3. Replace root with the last element 4. Heapify the reduced heap 5. Repeat until heap is empty ### Characteristics: - Guaranteed O(n log n) time - In-place sorting - Not stable - Good worst-case performance