Next:
Solution Techniques
Up:
CSE 2320: Algorithms and
Previous:
Example: Fibonacci
Solution Techniques
Guess:
T(n) = O(
2
^{n}
), which means T(n)
c
2
^{n}
If
or
.
True for sufficiently large n.
Boundary:
T(0) = 1
c
2
^{0}
= c, c
1
Actually, T(n) =
.
Copyright © 1998 The University of Texas at Arlington