Empirical Study of Sorting Algorithms Complexity

Start with EmpiricalStudy.java

The goal of this project is to compare efficiency of three sorting algorithms by measuring the time it takes for them to sort exactly same array of integers.

Find and copy into your code implementations of three classic sorting algorithms: Quicksort, Bubble sort, and Selection sort. All 3 can be found in Chapter 17 folder of the text book source code posted in Course Info and Resources module of the course.

In main() write code that creates 3 identical arrays of size 1000000 filled with random numbers in the range [1 1000000]

Use timer code from RecursiveFibonacciTimer.java Download RecursiveFibonacciTimer.java from Chapter 17 folder to measure time it took each of the sorting algorithms to sort the array. Each sorting method must have the same set of numbers to sort, so use one of the 3 arrays you created for each method.

When printing out time, convert it into minutes and seconds format.

In the beginning of your file with the solution, in comments, record the timing results you got when running the sorting methods for me to see.

Finally, find out how much time it takes Quicksort to sort 100000000 random integers on your computer. Record that result in the beginning of the source code file too.

Make sure to create a text file with table-like formatted data similar to what you see below. Name the file EmpiricalStudyTimes.txt

Sorting Algorithm and Array Size	Time
Bubble Sort on array of 1000000 elements
Selection Sort on array of 1000000 elements
Quicksort on array of 1000000 elements
Quicksort on array of 100000000 elements