Best case. Write a program that produces a best-case array (with no duplicates) for sort()...

Best case. Write a program that produces a best-case array (with no duplicates) for sort() in algorithm an array of N items with distinct keys having the property that every partition will produce subarrays that differ in size by at most 1 (the same subarray sizes that would happen for an array of N equal keys). (For the purposes of this exercise, ignore the initial shuffle.)

The following exercises describe variants of quicksort. Each of them calls for an implementation, but naturally you will also want to use SortCompare for experiments to evaluate the effectiveness of each suggested modification.

Algorithm Quicksort