Next:
Solution Techniques
Up:
l2
Previous:
Example: Fibonacci
Solution Techniques
Guess:
T(n) = O(
), which means T(n)
c
If
or
.
True for sufficiently large n.
Boundary:
T(0) = 1
c
= c, c
1
Actually, T(n) =
.
Next:
Solution Techniques
Up:
l2
Previous:
Example: Fibonacci