September 26

• Begin Review of recursion

• The factorial function is a lame excuse for recursion -- it's more natural to code it iteratively.
• The fib function is slightly more natural to code recursively, but inefficient (unless you keep track of intermediate values).
• The Tower of Hanoi is natural to code recursively, and you can't beat it's complexity: $O(2^n)$ operations for $n$ rings.