C++ Sorting 1

The files sorts and [login to view URL] contain the function prototypes (with pre/post conditions) and function implementations respectively. The file, [login to view URL] is the driver file. **Problem** Code insertion sort, mergesort, heapsort, and quicksort using the pseudocode from the text, and run these sorts on two arrays as specified below. Time the sorts and create a table for the output that displays the actual times. Your times should be in seconds, accurate to at least three decimal places. DO NOT DISPLAY THE ARRAYS! Here are the problem specifications. 1. 2. 1. Display a menu that gives these choices. 1. 2. a. Run all sorts on a random array. 3. b. Run all sorts but insertion sort on a random array. 4. c. Run all sorts on a random array and a pre-sorted array (smallest to largest). 5. d. Run all sorts but insertion sort on a random array and a pre-sorted array. 6. e. Quit. 3. 2. Prompt the user to enter a number that represents the size of an array. 4. 3. Create an array of ints of the user-specified size. 5. 4. Populate the array with random ints in the range [1, 30000]. 6. 5. Run the menu option chosen in step 1 above. Be sure to run the all sorts on the same numbers and in the same order. 7. 6. Time the sorts and save the times. 8. 7. Display the results of your sorts in table format with the accuracy specified earlier. 9. 8. Re-display the menu from step 1. Here is an example of the expected output Sort Unsorted time Sorted time // Choice d from the menu ## Deliverables ------------------------------------------------------------------------ Mergesort 0.000 0.000 Heapsort 0.000 0.000 Quicksort 0.000 0.000 OR Sort Unsorted time // Choice b from the menu --------------------------------------- Mergesort 0.000 Heapsort 0.000 Quicksort 0.000 -1- CSC 3412 Homework 5 Summer 2004 Notes 1. 2. 1. You may use the rand() function from <cstdlib> to generate your pseudorandom numbers. 3. 2. You may use the clock() function from <ctime> to help you generate clock times. 4. 3. You should use operators new and delete to allocate and deallocate your arrays. 5. 4. Each sort should sort the same numbers in the same order. 6. 5. Be sure to test your program using the g++ compiler before submitting. 7. 6. Be sure to use program style (pre/post, header comments, sparse code comments, self-documenting names, whitespace, indentation, etc.). Finally, are the results of your program what you expected ## Platform **_Please write your code based on the pseudocode provided in the attached zip file. THE PROGRAM MUST COMPILE ON A G++ COMPILER _** THE DUE DATE FOR THIS IS MONDAY EVENING JULY 12TH 2004 [login to view URL] TIME.