Day 16: mat385

• Announcements
  • Your prolog projects are due on the wiki..... I'll check them tonight about 11:00 pm....

    I want to thank Jim, Ted, and Chris, for providing early, timely examples for your classmates to work from. Very helpful, I'm sure. And I want to congratulate Nick Cooper, who took the problem I gave him in class last time and found a very nice solution (which also helped several).

  • Graded induction homework: #23, 63

  • Chris Fronk is giving a hands-on introduction to Sage, an open source alternative to Mathematica and MATLAB at 3:00 today in the ST 359 lab. Please come!

• Any questions on recursion, Sections 2.4/2.5?

• We're going to start by considering 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)?

• We may have a little time for section 2.6: Analysis of Algorithms

Links:

• Examples of recursion focused on the Fibonacci numbers.