# Middle quick

If quick sort is always implemented choosing the central element of the array as the pivot, in an array of $$n$$ elements. What is the tightest upper bound for the worst case performance?

×