- Searching: linear and binary search
- Sorting: selection, bubble, and insertion sort

- swapping two values in a list
- ord() and chr() functions
- searching and sorting algorithms
- complexity (big O, number of steps) of searching and sorting 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 sort function (any sort) that takes in a list and sorts it in place. Show what a call to your sort function would look like from main.
- 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 ----------------

- Consider the following function, oneLoop, which is similar to the
inner loop from bubble sort:
def oneLoop(ls): print "in oneLoop" for j in range(len(ls)-1): if ls[j] > ls[j+1]: tmp = ls[j+1] ls[j+1] = ls[j] ls[j] = tmp

(1) Given the list ls = [17, 4, 19, 3, 11, 8], what is ls after one call to oneLoop(ls)?(2) Given the following main function, trace through its execution showing all program output and drawing the stack right before the call to function oneLoop returns:

def main( ): print "in main" my_list = [6, 8, 19, 3, 7] print my_list oneLoop(my_list) print my_list

- 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) ord('b') < ord('f') (6) 'b' < 'f' (7) chr(ord('a'))

- Show how the following list would be changed after selection
sort does its first 3 swaps:
[15, 99, 4, 30, 3, 82, 7, 42]