CMT 1314 Search Lecture
- This talk is on my server at
www.cwa.mdx.ac.uk/chris/talks/cmt1314-jan08/intro.html
- Perhaps the simplest class of algorithms is searching.
- The programmer gets to decide (or is assigned) the
structure that is being searched.
- Now, a particular function (called search) is called, and
can access the structure.
- The function is given a parameter (the thing being searched for),
and it either returns a boolean or the record associated with
the item.
- Search happens all the time.
