Discuss the material in the recursion chapter, including the base conversion, recursive fractals, making change problem, fibonnaci, and memoization.

Some code is in the recursion folder.

The last concept in the chapter - dynamic programming - is a topic that we may come back to but will skip for now, except to mention what it is.

The two versions of fibonnaci that we did in class (one with memoization, one without) are posted. We showed that f(100) for example is too slow to finish with the stupid one, but fast with the memoized one.

http://cs.marlboro.edu/ courses/ spring2017/algorithms/ notes/ Feb_16
last modified Thursday February 16 2017 11:32 am EST

name last modified size

---

fib_smart.py Feb 16 2017 11:31 am 204B fib_stupid.py Feb 16 2017 11:31 am 158B