Write a program that implements the Bubble Sort, Selection Sort and Insertion Sort. 

Create a function that will populate a vector with n random numbers.

Use that function to populate a vector then make 2 additional copies of the vector.  Using the time() function, calculate how long it takes each sorting algorithm to sort the vector. Test this program with vectors of the following sizes:

5,000

10,000

25,000

50,000

100,000

Answer rating: 100% (QA)

Heres a C program that implements the Bubble Sort Selection Sort and Insertion Sort algorithms along with a function to populate a vector with n rando... View the full answer