Starting with the Java code for Quicksort given in this chapter, write a series of Quicksort implementations to test the following optimizations on a wide range of input data sizes. Try these optimizations in various combinations to try and develop the fastest possible Quicksort implementation that you can.

(a) Look at more values when selecting a pivot.

(b) Do not make a recursive call to qsort when the list size falls below a given threshold, and use Insertion Sort to complete the sorting process.

Test various values for the threshold size.

(c) Eliminate recursion by using a stack and inline functions.