Day 15: mat385

Last time: 2.4/2.5

Next time: section 2.6

Today:

Announcements
- Projects? Now thirteen people on the wiki....; but only two "teams" have anything other than the boilerplate that I put up.
- Hand in your Induction homework.
- You can make up points by coming to see me. You can get back 30% of your missed points by paying me a visit, so that we can talk about what you did wrong. View the key, first, however.
Any questions on recursion, Section 2.4/2.5?
Let's continue with highlights from sections 2.4/2.5: Recursion
I'm hoping to end on the following problem:
I showed an example of a recursive algorithm for the calculation of the Fibonacci numbers (fib, in lisp), and showed that it's not a very wise algorithm because of the dramatic growth in the number of invocations of "fib". Exactly how many times will fib be called for the calculation of fib(n)?

Website maintained by Andy Long. Comments appreciated.