Outline for November 28, 2023

Reading: none
Assignments: Homework 4, due November 29, 2023; Homework 5/Project, due December 15, 2023

1. Searching
   1. Search unordered list [linsearch-u.py]
   2. Search ordered list, na{\:i}ve way [linsearch-o.py]
   3. Search ordered list, smarter way [binsearch-1.py]
   4. Recursive [binsearch-2.py]
      1. Base case: high < low, return failure; word is list[mid], return mid
      2. Recursive part: if word < list[mid], search word[low..mid−1]; if word > list[mid], search word[mid+1..high]

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 235A, Computer and Information Security Version of December 20, 2023 at 9:26PM

You can also obtain a PDF version of this.