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). Please refer IntroSort for example
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
.png)
