Example #6 continued

• Basis: T(0) ? b > b?-1 and T(1) ? b = b?0

• Inductive step: Assume T(m) ? b?m - 1 for all m < n

T(n) ? T(n - 1) + T(n - 2) + c

? b?n-2 + b?n-3 + c

? b?n-3(? + 1) + c

= b?n-3?2 + c

? b?n-1

• T(n) ?

• Why? Same recursive call is made numerous times.

Previous slide

Next slide

Back to first slide

View graphic version