One post tagged with "heap sort"

HeapSort is a sorting method that works with the heap data structure. The method works in-place, since no further storage space (e.g. array, vector etc...) must be created here. HeapSort has an overhead of $O(nLog(n))$ in the best case, average case and worst case.