Project 3 Solution

Description

Description: You will write a program that compares the execution time of several sorting algorithms, and displays the results as a table

• You will be sorting arrays of 50,000 integers
• The integers must be randomly generated between 1 and 10,000
• Each sorting algorithm will use the same array
• The sorting algorithms to be used are:
  • Selection
  • Insertion
  • Quick
  • Modified Quicksort (size 20)
  • Radix
    • You were not given the code for this algorithm, you must actually write it
  • Heap
    • You may NOT use the heap in the STL

• The comparisons should be done on 5 different arrays, and the average execution time should be displayed
• Each algorithm will be called in a function, and each function definition will be templated
• Each function template will be in a separate header file
• Internal and External documentation is required
• All files (driver, headers, documentation) will be emailed to me as attachments