Question

Consider thequick sort algorith finding a pivot element

Answer 1

Consider the Quicksort algorithm. Suppose there is a procedure forfinding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of theelements. Let T(n) be the number of comparisons required to sort nelements. Then.