METYCSSA (#4)

• Recursion

• Almost always yields a recurrence

• Recursive max

T(0) <= b

T(n) <= c + T(n - 1) if n > 0

• Analysis

T(n) <= c + c + T(n - 2) (by substitution)

T(n) <= c + c + c + T(n - 3) (by substitution, again)

T(n) <= kc + T(n - k) (extrapolating 0 < k ? n)

T(n) <= nc + T(0) = nc + b (for k = n)

• T(n) ?

Previous slide

Next slide

Back to first slide

View graphic version