(1a) Complete the following table.  Assume there are n numbers.

				 Binary Search                      Linear Search

Best-case running time


Worst-case running time



(1b) Suppose you need to look up a person's identifier from a list of 2**33 numbers (that is roughly the number of people in the world currently).  What is the worst-case running time for using linear search?  For binary search?




(2a) If you have a list of unsorted numbers and want to see if the number 33 is in the list, should you use linear search or binary search?


(2b) What if your list of numbers is already sorted?



(3) For the following list of sorted numbers, show what the values of start, end, and middle are for looking for the number 33.

Numbers:    0   1   5   12   18   22   34   45   56   70   91   99
Index:      0   1   2    3    4    5    6    7    8    9   11   12


start: 	    0

middle:	    5

end:	    12