Where is Heap Sort used practically? - GeeksQuiz

Where is Heap Sort used practically? - GeeksQuiz

Where is Heap Sort used practically?

Although QuickSort works better in practice, the advantage of HeapSort worst case upper bound of O(nLogn).

MergeSort also has upper bound as O(nLogn) and works better in practice when compared to HeapSort. But MergeSort requires O(n) extra space

HeapSort is not used much in practice, but can be useful in real time (or time bound where QuickSort doesn't fit) embedded systems where less space is available (MergeSort doesn't fit)

Source: http://qa.geeksforgeeks.org/index.php?qa=14&qa_1=where-is-heap-sort-used-practically

Read full article from Where is Heap Sort used practically? - GeeksQuiz