[ Read the following questions carefully and choose the right answer. ]

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 ?

A O(n)

B O(n2)

C O(n Log n )

D O(n!)

Solution

Correct Answer: Option B

Practice More Questions on Our App!

Download our app for free and access thousands of MCQ questions with detailed solutions