PA of Algorithms Q109

0. 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

Answer
Comment
Array

Option : A
Explanation :
The Worst case time complexity of quick sort is O (n²). This will happen when the elements of the input array are already in order (ascending or descending), irrespective of position of pivot element in array.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.