Question

Which of the following is true? Group of answer choices worst case time of Heapsort is better than worst cast time of Quicksort average case time of Quicksort is better than average case time of Heapsort best case time of Quicksort is worse that best case time of Heapsort both a) and b)

Answer 1

Worst case time of Heapsort is better than worst case time of Quicksort.

Step-by-step explanation:

Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.