What technique is used to get a good running time for an algorithm such as quick sort, which has bad worst case running time but good average case?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Which of the following sorting algorithms has average-case and worst-case running time of O?
- Which of the following algorithms does not have the same complexity for the worst case and the average case?
- Which of the following is not correct about quicksort algorithm?
- In quick-sort, for sorting n elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot us...
- In quick-sort, for sorting n elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot us...
- If 0(nlogn) time is used in average case, which of the following sorting techniques is used?
- What is the complexity of 'Quick sort' in the worst case?
- To implement Dijkstra's shortest path algorithm on un weighted graphs so that it runs in linear time, the d...