Algorithms and Data Structures - Heap Sort Characteristics Time complexity: Best: Ω(n log(n)) Average: Θ(n log(n)) Worst: O(n log(n)) Space complexity: Recursive: O(log(n)) Iterative: O(1) In-place Unstable Demos: Basic Implementation Optimized Comparisons Without Recursion Demonstration Algorithm Visualizer Algorithm Visualizer References Other Algorithms & Data Structures
