Question

Difference between heap sort and quicksort

Answer 1

It is a recursive algorithm that uses the divide and conquer method. It is also the fastest generic sorting algorithm in practice. ... Like merge sort, the worst case time of heap sort is O(n log n) and like insertion sort, heap sort sortsin-place. In section 2, Quicksort andHeapsort algorithms described and compared.