Project Assignment
In your program:
• Create a function that will generate a list of random numbers. Be sure the numbers are in random order. The function should accept a number that represents the size of the list and return the list.
• Modify the Selection sort, Bubble sort and Merge sort functions to perform benchmark analysis on each of these functions. You MUST use counting comparisons and counting swaps AND you MUST use time. These files are located in the li\kopploutbox\CS 222 01\Final Project folder. YOU MUST USE THESE SORTING FUNCTIONS FOR THIS PROJECT. If you use any other functions or write a different one, you will receive a 0 for the project.
• Run the benchmark analysis on each sorting function for list sizes of 100, 1000, and 10000. Print the size and the benchmark values (time and counts). Write a function that will store the sorted for the Selection list into a file. The numbers should be stored 15 per line separated with a space. The filename must be sorted Numbers.txt. Only execute this function for list size of 1,000.
• Write an essay discussing your results. Be sure to explain your results completely and thoroughly. In your conclusion, determine which, if any, of the sorting techniques are better. You must use a word processor.
Add the following comments to the beginning of the program.
• Program Description: You write a short description of what the program will do
Format your assignment according to the following formatting requirements:
1. The answer should be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides.
2. The response also include a cover page containing the title of the assignment, the student's name, the course title, and the date. The cover page is not included in the required page length.
3. Also Include a reference page. The Citations and references should follow APA format. The reference page is not included in the required page length.