Heap Sort

Time and Space Complexity

• Best Case Time Complexity: O(n log n)
• Average Case Time Complexity: O(n log n)
• Worst Case Time Complexity: O(n log n)
• Space Complexity: O(1)