Sorting
April 18, 2024Question 9639 – Sorting
April 18, 2024GATE 2001
|
Question 14
|
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
|
O(n)
|
|
|
O(n log n)
|
|
|
O(n2)
|
|
|
O(n!)
|
Question 14 Explanation:
In worst case Randomized quicksort execution time complexity is same as quicksort.
Correct Answer: C
Question 14 Explanation:
In worst case Randomized quicksort execution time complexity is same as quicksort.