CMSC 451 A T Still University Behavior of Java Implementations Lab Report

Look at the PDF below:

Use Merge Sort please

The first project involves benchmarking the behavior of Java implementations of one of thefollowing sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort,quick sort or heap sort. You must post your selection in the “Ask the Professor” conference. Nomore than five students may select any one algorithm.You must write the code to perform the benchmarking of the algorithm you selected. Yourprogram must include both an iterative and recursive version of the algorithm. You do not haveto write the sorting algorithms yourself, you may take them from some source, but you mustreference your source.You must identify some critical operation to count that reflects the overall performance andmodify each version so that it counts that operation. In addition to counting critical operationsyou must measure the actual run time in nanoseconds.In addition, you should examine the result of each call to verify that the data has been properlysorted to verify the correctness of the algorithm. If the array is not sorted, an exception should bethrown.It should also randomly generate data to pass to the sorting methods. It should produce 50 datasets for each value of n, the size of the data set and average the result of those 50 runs. The exactsame data must be used for the iterative and the recursive algorithms. It should also create 10different sizes of data sets. Choose sizes that will clearly demonstrate the trend as n becomeslarge. Be sure that the data set sizes are evenly spaced so this data can be used to generate graphsin project 2This project should consist of two separate programs. The first of those programs should performthe benchmarking described above and generate two data files, one containing the results fromthe iterative algorithm and the one containing the results of the recursive algorithm.The benchmarking program must be written to conform to the following design: