Question

Experiments indicate that heap sort requires _____ as much time as quick sort for randomly sorted input.

• A. Twice
• B. Thrice
• C. Four times
• D. Five times

Answer 1

The correct option is A Twice

Experiments indicate that heap sort requires twice as much time as quick sort for randomly sorted input.

Heap sort is a comparison based sorting technique based on binary heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end. We repeat the same process for remaining element.

Quick sortis a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays. Quick sort partitions an array and then calls itself recursively twice to sort the two resulting sub arrays.