Next:
Example: Fibonacci
Up:
CSE 2320: Algorithms and
Previous:
Example: Factorial
Solution Techniques
Guess:
?
O(n)
Show:
?
T(n) <= cn
Assume:
?
T(n-1) <= c(n-1)
T(n)
c(n-1) +
= cn - c +
cn
If c
. True for large enough c.
Initial Conditions:
T(1) =
cn
Copyright © 1998 The University of Texas at Arlington