1. Choose one of the recursive sorting algorithms and vary the point where you cut off the recursion. Below this size, the array is sorted by a quadratic algorithm. For each different recursion...

1. Choose one of the recursive sorting algorithms and vary the point where you cut off the recursion. Below this size, the array is sorted by a quadratic algorithm.

For each different recursion threshold, get a rough estimate of the time required to sort a random array of 10,000,000 integers.You can get an estimate of this kind by calling System.currentTimeMillis both before and after the sort. The difference between the two return values is the approximate number of milliseconds required by the sort method. (It is only approximate because the sort method does not have exclusive use of the computer during the time that it’s executing.)