Gate CS-2001 Question Paper With Solutions

Q. 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?

Answer: (C)

Explanation:

Learn More:   Gate EC-2015 - 1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here