Chapter 4 Recurrences
4.1 The substitution method
guess and use mathematic induction to prove.
4.2 The recursion-tree method
4.3 The master method
a 'cookbook' method for solving recurrences of the form: T(n) = aT(n/b) + f(n)