Part II Sorting

Each person will analyze two sorts.

1. Bubble sort (last names with odd number of letters)

2. Insertion sort (last names with even number of letters)

3. Quick sort (last names with odd number of letters)

4. Merge sort (last names with even number of letters)

In this assignment, we will be learning about, describing, coding, and empirically looking at the work involved in each sorting algorithm. Use 4 data set sizes. Results will be based on execution time for each sort. The size should have a regular increment. For example, using a regular increment of 10,000, you might have sizes of 10,000, 20,000, 30,000, and 40,000. Your data size will be chosen based upon the ability to obtain meaning results.

Submit:

A Word document named SortDescriptionsLastName.docx. The Word document should be modeled after the selection sort description under Course Content. The Word document should have:

A few useful web resources for the sort.

A detailed explanation (in your own words) of the sort.

A clear visual representation of the sort (cite source if found on web, book ).

Two screen shots of your program displaying the sorted array for each sort. These screen shots will not show your entire array but only a part.

An Excel document that shows the empirical results of running each sort. The name of the file should be SortEmpiricalAnalysesLastName.xlsx.

Code for the algorithm in a working program (similar to SelectionSort.cpp).

Code should be documented.

Code should use meaningful identifiers (do not use abbreviated variable names such as r for right).

Code should be well-structured and easy to read.

You should be able to understand every aspect of the code that you are using.

The code for each sort should be organized in its own project folder a compressed zipped folder for each project. Use only .zip folders (not .rar folder).