$//$ selectionSort

$//$ Make array

$//$ Record start time

$//$ Sort array using selectionSort static method

$//$ Record end time

$//$ Print out results

$//$ insertionSort

$//$ same steps as above with insertionSort method.

$//$mergeSort

I$//$ same steps as above with mergeSort method.We saw that a merge sort performs roughly the same depending on the type of array we have. For this last exercise, we want to see how the merge sort performs against other sorts.

We are using the same two classes that we used a couple of lessons ago. This time the Sorter class has three public methods: mergeSort, insertionSort, and selectionSort. You are also given the SortTester class which has three static methods for creating $3$ different types of arrays, random, nearly sorted, and reverse sorted.

This test is going to be similar to the previous one, but instead of testing three different types of arrays, you are going to test $3$ different types of sorts on the same array type. Create an array using the makeRandomArray method, then take a start time using System.currentTimeMillis$().$ Next, run the array through one of the sort methods in the Sorter class. Finally, record the end time. Subtract the start time from the end time and print out the results.

You will test each of the $3$ sorts.

Feel free to also test this with other array types. Is the fastest sort always the same?

Sample Output

Selection Sort: $**$ Results Hidden $**$

Insertion Sort: $**$ Results Hidden $**$

Merge Sort: $**$ Results Hidden $**$

Note: Keep the array size at $20$k or less. Otherwise the program will take too long to return.