PA of Algorithms Q80

80Randomized 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?

Option : C
Explanation :
The worst case time complexity is O (n²)

Forgot your password?

I agree with the Terms.