Vidyalelo
Data Structure · Q372

Sorting Algorithms

Programming · Data Structure · question 372

Q372

What is the worst case time complexity of randomized quicksort?

A.
O(n)
B.
O(n log n)
C.
O(n2)
Answer
D.
O(n2 log n)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board