sortAlg.java

This class defines a sorting algorithm optimized for randomly generated arrays.

Implement the sorting algorithm that you think is optimal here. It is used by the

randMatrix class. It contains only two methods, a sortA method recursively sorts an

array, and a helper method to perform any external functions the algorithm may need.

These methods are static, so they do not require an instance of this class to be created.

Bonus pro$-$hint: If you want to$,$ you can implement different sorting algorithms and

calculate the exact run$-$time using System.nanoTime$(),$ you could test a few input

values of n to average run$-$time.