In this assignment you will evaluate relative performance of different sorting algorithms. We discussed them all in class and several different versions of code are in the textbook, OpenDSA website and other resources that you are using. Your job is to provide their implementation so that they can be incorporated in the provided benchmark program for performance evaluation.Objectives The goal of this project is for you to master (or at least get practice on) the following tasks: • developing and writing recursive algorithms, • developing and writing sort methods, • working with existing code, • implementing generic methods, • analyzing data produced by the programs, • validating program correctness based on data results, • improving code efficiency based on data results.
You are given a set of three source code files. SortTester This class is the actual benchmark program that runs all the test. You should not be modifying anything in the class. (You may while you are developing and testing your code, but the submitted version should be unchanged). This is the program that displays the data that you need to collect and analyze.
Sorter This is an interface that you have to implement for your implementations of merge sort, quick sort and selection sort. For each of the three algorithms you have to provide a class that implements the Sorter interface. In order to work with SortTester, your classes need to be called MergeSort, QuickSort, and SelectionSort. InsertionSort This is a class implementing the Sorter interface. It implements the insertion sort algorithm. You do not need to do anything with this class. It is provided as a guide for how to implement your other classes.
