# Question: suppose in every recursive call to sort a subarray we...

###### Question details

Suppose in every recursive call to sort a subarray, we choose a pivot, in time proportional to the size of the subarrary, that is never one of the smallest 1/4 or largest 1/4 elements. What is the worst case running time of Quicksort on inputs of size n in this case? And what is the recurrence relation representing the running time?