In this programming, you learn more about efficiency of algorithms based upon run time. Hence you need to use time() or clock() function to measure the execution of sorting algorithms and bubble sort. Here you are asked to use the following to create an array, Num[8192].   Use srand() to generate a random number each time; The range of the random numbers should be 0... 10000.  Insert time-measurement statements to print it in seconds or milliseconds Use clock();

Use c++.

In this programming, you learn more about efficiency of algorithms based upon run time. Hence you need to use time() or clock() function to measure the execution of sorting algorithms and bubble sort. Here you are asked to use the following to create an array, Num[8192].

• Use srand() to generate a random number each time;
• The range of the random numbers should be 0... 10000. 
• Insert time-measurement statements to print it in seconds or milliseconds
• Use clock();

The expected outcome looks like the following: 

• Bubble sort takes xxx seconds. 

• Bubble sort takes xxx milliseconds.

Implement the bubble sort for the following numbers; there would be no match depending on the generated Num[8942]

•  Find these numbers and print the number of If-comparisons for 71, 9997, 5000, 2, 3015;
•  Binary search 71 takes 8 comparisons-found

 Binary search 9997 takes 13 (log28192 = log 213) comparisons - not found