Question

This program should test the running time of these algorithms:

Selection Sort

Insertion Sort

Bubble Sort

Merge Sort

Quick Sort

Heap Sort

You have access to the implementation of all of these sorting algorithms, and you may use what is provided in your text directly. Be sure to cite the source of these implementations in the header of your program. Please maintain the property that these sorting algorithms sort arrays in ascending order.

For this homework, you will write a program that demonstrates the running time of each of these algorithms, and compare these times to the theoretical complexity. You may run the sorts on arrays of integers, but you must test each of the following cases:

An array in descending order

An array in ascending order

An array in randomly sorted order

Note: When testing an array in randomly sorted order, run this test 10 times and take the average over those 10 tests. Your arrays should be large enough to show differences between the sorting algorithms, but not so large that they overwhelm your computer.

Your statistics should be organized in a table as follows:

Name of Sort

Worst Case Theoretical Running time

Best Case Theoretical Running Time

Tic/Toc (or Wall Clock) running time (Descending Order)

Tic/Toc (or Wall Clock) running time (Ascending Order)

Tic/Toc (or Wall Clock) running time (Randomly Sorted Order)

Only a small amount of research on your part should lead you to some built in timers that Java has available - make sure these timers measure literal execution time.

This table should be printed to a txt file named SortingStats.txt.

When you submit, you must submit both your java file, as well as the txt file. I will still run your program to check it against your output. Be sure to adhere to javadoc style in your code.

Answer 1

There are total 4 classes. Student class is inherited and publicly accessed by 2 more classesFirstYearStudent and SecondYearStudent and there is 1 more School class. So total 4 classes

In main function when School object is called 100 constructors from FirstYearStudent of Student and 100constructors from SecondYearStudent of Student and 1 of school constructor and 100 constructor of FirstYearStudent itself and 100 constructors of SecondYearStudent which means s a total of 401 objects will be created because 401 will be created.