Homework Assignment #7
Objective
To learn how to solve recurrence relations for typical divide-and-conquer algorithms, including the use of the “change of variable” technique.
Exercises
Show all work. i.e., justify your answers.
Questions 1 and 2
Question 3
Analyze the running time of 3-part Mergesort (like traditional mergesort but involves dividing the problem into thirds rather than into halves) using Recurrence Relations solution techniques. You may conclude with the general solution, since you have no initial conditions, or you can choose your own initial conditions. (Do not use the Master Theorem.)
Question 4
Back to top