Question: 1. (10 pts) Suppose that we modify the Partition algorithm in QuickSort in such a way that on on every third level of the recursion

1. (10 pts) Suppose that we modify the Partition algorithm in QuickSort in such a way that on on every third level of the recursion tree it chooses the worst possible pivot, and on all other levels of the recursion tree Partition chooses the best possible pivot. Write down a recurrence relation for this version of QuickSort and give its asymptotic solution. Then, give a verbal explanation of how this Partition algorithm changes the running time of QuickSort
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
