Please demo the program to the instructor during
open lab or upload a single .java file to Ecampus.

Create a program named sort.java that reads in primes1.txt.
Sort these numbers using bubble, selection, merge, and radix sorts.
Each sort should list the elapsed time, iterations, and print the first 10 and
last 10 numbers in the sorted array.

__Example output__

This program compares
the bubble, selection, merge, and radix sorts.

The data set is 78498 unsorted integers

1. Bubble Sort

Seconds to sort = ???

Number of iterations = ???

First 10 - 2 3 5 7 11 17 23 29 31 37

Last 10 - 999883 999863 999907 999917 999931 999953 999959 999961 999979 999983

2. Selection Sort

Seconds to sort = ???

Number of iterations = ???

First 10 - 2 3 5 7 11 17 23 29 31 37

Last 10 - 999883 999863 999907
999917 999931 999953 999959 999961 999979 999983

3. Merge Sort

Seconds to sort = ???

Number of iterations = ???

First 10 - 2 3 5 7 11 17 23 29 31 37

Last 10 - 999883 999863 999907
999917 999931 999953 999959 999961 999979 999983

4. Radix Sort

Seconds to sort = ???

Number of iterations = ???

First 10 - 2 3 5 7 11 17 23 29 31 37

Last 10 - 999883 999863 999907
999917 999931 999953 999959 999961 999979 999983