Question: ALGORTHIMS NOTE: for each question, write exact answer (do NOT write in terms of big-O). [ 6 marks ] Answer the following if we run

ALGORTHIMS

NOTE: for each question, write exact answer (do NOT write in terms of big-O).

[6 marks] Answer the following if we run MergeSort on the given array A=[7, 6, 1, 2, 9, 8, 3, 5, 4, 2]

a. Total how many times MergeSort will be called.

b. Total how many times Merge will be called.

c. Draw the detailed diagram showing each function call with all the parameter values, (A, p, q) as done in the class.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!