Randomized quicksort is an extension of quicksort where the pivot is chosen…

PYQ GATE 2001

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?

  1. A.

    O(n)

  2. B.

    O(n*log(n))

  3. C.

    O(n2)

  4. D.

    O(n!)

Attempted by 693 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…