Repeat Problem 2 by measuring the program’s running time in milliseconds.
a. Run the program of Problem 1, with a properly inserted counter (or counters) for the number of key comparisons, on 20 random arrays of sizes 1000, 2000, 3000, . . . , 20,000.
b. Analyze the data obtained to form a hypothesis about the algorithm’s average-case efficiency.
c. Estimate the number of key comparisons we should expect for a randomly generated array of size 25,000 sorted by the same algorithm.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.