Problem
Suppose we modify the deterministic version of the quick-sort algorithm so that, instead of selecting the last element in an nelement sequence as the pivot, we choose the element at index ... ln/2.... What is the running time of this version of quick-sort on a sequence that is already sorted?