- Searching: linear and binary search

- swapping two values in a list
- searching algorithms
- complexity (big O, number of steps) of searching algorithms
- string comparisons ("alice" < "zelda")

- True/False questions 1-4 on page 460 (Chapter 13)
- Multiple choice questions 1, 2, and 6 on page 461 (Chapter 13)
- Discussion question 1 on page 462 (Chapter 13)
- Write a function to return the index of the smallest item in a given list.
- Show the values for low, high, and mid for each step in searching the list
L for the value x using binary search.
x = 99 L = [-20, -12, -4, 1, 7, 44, 45, 46, 58, 67, 99, 145] low mid high ----------------

- Given the following definition:
ls = ["fish", "squirrel", "cat", "dog", "monkey", "pony"]

What are the value and type of the following expressions:(1) ls[3] > "apple" (2) ls (3) ls[3] (4) ls[3][1] (5) 'b' < 'f'