Day 12, Mat385

Last time

Next time

Announcements
- The Zooms continue
  A menu of our past zooms...
- Have you heard of Fibonacci Brewing in Mt. Healthy?
  I told you that Fibonacci numbers are important!
- Your 3.1 homework is graded: problems 3, 21, 42
  - 3: simple!
  - 21: first principle; just one base case
    State what you're doing (e.g. checking an anchor case or two), your assumptions, and your conclusions.
  - 42: second principle! (and we need two base cases)
  - Here's some nice student work, doing things the way that I like them. (Keep the grader happy!)
Last time:
- We wrapped up recursion: Section 3.1 (Recursive Definitions)
- and then started Section 3.2 (Recurrence Relations)
Today: We'll
1. wrap up Section 3.2 (Recurrence Relations), then
2. Start on Section 3.3 (Analysis of Algorithms)
Links:
- Recursive computation of Fibonacci numbers (in lisp)
- Recursive computation of rows from Pascal's triangle (in lisp)
- "String exponention" (in lisp)
- Here is the recursive selection sort algorithm, in lisp:
- Here is a recursive binary search algorithm in lisp:
- Closed-form computation of Fibonacci numbers (in lisp)
- Recursive Euclidean Algorithm in lisp:
  
  Written as a while loop, using the recurrence relation:
- Here is a recursive bubbleSort algorithm in lisp
  
  (coded up following our author's algorithm, in section 3.3, p. 214, as closely as possible).

Website maintained by Andy Long. Comments appreciated.