Heap Sort
Time Complexity: O(n log n)
Space Complexity: O(1)
Process
Build a binary heap from the list, then repeatedly remove the maximum (for ascending order) element from the heap and insert it at the end of the sorted list.
Efficiency
Efficient and has a time complexity of O(n log n). It uses a data structure called a heap for sorting.