GATE | CS | 2014 | Set 3 | Algorithms | Sorting | Question 64

Last Updated :
Discuss
Comments

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

O(n2)

O(n*log(n))

Theta(n*log(n))

O(n3)

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,Sorting Algorithms Quiz,GATE-CS-2014-(Set-3),Top MCQs on QuickSort Algorithm with Answers,Algorithms GATE CS PYQ Quiz,Searching & Sorting GATE CS PYQ Quiz
Tags:
DSA Quiz
GATE
Algorithms
GATE CS
Share your thoughts in the comments