Outline for February 11

Reading: text, §10
Due: Homework 3, due on February 15 at 11:55pm

  1. More recursion
    1. Nested lists: is an item in a list? [isinlist.py]
    2. Fibonacci numbers [rfib.py]
    3. Tower of Hanoi [hanoi.py]
  2. Searching a list
    1. Example use: linear search [linsearch.py]
    2. Example use: recursive linear search [rlinsearch.py]
  3. Speed: compare iterative and recursive Fibonacci programs [timefibs.py]

UC Davis seal
Matt Bishop
Office: 2209 Watershed Science
Phone: +1 (530) 752-8060
Email: mabishop@ucdavis.edu
You can also obtain a PDF version of this.
Version of February 8, 2019 at 7:53PM