Gate CS-2014-3 Question Paper With Solutions

Q. 24 You have an array of n elements. Suppose you implement quicksort by always
choosing the central element of the array as the pivot. Then the tightest upper
bound for the worst case performance is

(A) O(n²)

(B) O(nLogn)

(C) Theta(nLogn)

(D) O(n³)

Answer: (A)

Explanation: