If loading fails, click here to try again
Quicksort is ________ efficient than heapsort in the worst case.
Question 1 Explanation:
As worst case time for quicksort is O(n
) and worst case for heap sort is O(n logn).
There is 1 question to complete.
You have completed
Your score is
You have not finished your quiz. If you leave this page, your progress will be lost.
Final Score on Quiz
Attempted Questions Correct
Attempted Questions Wrong
Questions Not Attempted
Total Questions on Quiz
Answer Choice(s) Selected
Need more practice!