Last Update: 17 November 2010
Note: or material is highlighted |
Note: A username and password may be required to access certain documents. Please contact Bill Rapaport.
Index to all lecture notes
…Previous lecture
n | f(n) |
---|---|
0 | 1 |
1 | 6 |
2 | 11 |
3 | 16 |
4 | 21 |
… | … |
n | 5n+1 |
Is f(n), which = f(n–1)+5, also = 5n+1?
Do these algorithms have the same I/O behavior?
is most easily described not by giving a formula for each term:
e.g.) Fib(n) = (φ_{1}^{n} – φ_{2}^{n})/√5, where φ_{1} = (1+√5)/2 and φ_{2} = (1–√5)/2 (!!)
Rather, it is most easily described by showing you the first 2 terms
& then giving you a formula for computing the next term
based on the 2 previous terms:
Could try: