Answer to Question #22653 in C++ for shalenee

Question

By choosing any THREE (3) sorting algorithms that you know, you are about to find the most efficient sorting algorithm used to sort the following set of numbers:

45 88 0 91 13 76 33 43 74 16 88 66 13 63 8

You may add line(s) of code to get the execution time for different sorting algorithms (i.e. by importing time.h in your code). Try to run the code and use the set of numbers given above as the input. The output should display the sorted numbers and the time taken to sort the numbers.


1. Find any THREE (3) sorting algorithms
2. Do some research on the algorithm (the description, efficiency, etc)
3. Find any C++ source code for all the three sorting algorithm
4. Add lines of code to record and display time taken to execute the sorting part.
5. Use the numbers given as the input / to initialize the array.
6. Compare the sorting algorithms and choose the most efficient among all.