The sorting algorithms that will be examined are:

1. Selection sort
2. Insertion sort
3. Merge sort
4. Quick Sort

All sorting algorithms must sort the arrays in ascending order.

Each sorting and searching algorithm will be comparatively run on arrays of the following sizes:

1. fifty (50)
2. one thousand (1,000)
3. ten thousand (10,000)
4. one hundred thousand (100,000)
5. one million (1,000,000)

Each sort is to be tested on the same data set to strive for some consistency.

Sorting Methodology and Requirements:

1. Create a core data set called coreData which must be a single array of size one million (1,000,000) integers filled with random numbers between one (1) and three million (3,000,000).

2. For each comparative test, four (4) copies (one for each sort to be tested) consisting of the same data from coreData must be made. For example, if the comparative test is on one thousand (1,000) elements, four arrays of size (1000) should be made and filled with a copy of the first one thousand (1000) elements of coreData.

All recorded times must be measured using System.nanoTime() for best accuracy. An example of how to use it is given below.

long start = System.nanoTime();

//code to be tested

long end = System.nanoTime();

long timeTaken = end start;

Test data size	Time unit
50	nanoseconds
1,000	nanoseconds
10,000	nanoseconds
100,000	nanoseconds
1,000,000	milliseconds

The unit for printing the time must be done according to the following table:

Output requirements:

The name of each sorting algorithm tested and the time it took to sort the data must be shown grouped by the test data size. For a test data size of fifty (50), the time taken for all the sorting algorithms to sort the data must be shown one after another.