Problem 1: Recurrences
Give asymptotic bounds for the following
Justify by naming the case of the
master theorem, iterating, or substitution
T(n) = T(n-2) + 1
What is the solution?
How would you show it?
T(n) = 1 + 1 + 1 + 1 + … + 1 = O(n)