You can choose any array item as the pivot for quicksort. You then interchange items so that your pivot is in theArray [ first].
a. One way to choose a pivot is to take the middle value of the three values theArray[first], theArray[last], and theArray [(first + last)/2], How many comparisons are necessary to sort an array of size n if you always choose the pivot in this way?
b. if the actual median value could be chosen as the pivot at each step, how many comparisons are necessary to sort an array of size n?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.