# bsearch.py def search(items, target): '''Locate target in items pre: items is a list of numbers post: returns non-negative x where items[x] == target, if target in items; returns -1, otherwise''' low = 0 high = len(items) - 1 while low <= high: # There is still a range to search mid = (low + high) // 2 # position of middle item item = items[mid] if target == item : # Found it! Return the index return mid elif target < item: # x is in lower half of range high = mid - 1 # move top marker down else: # x is in upper half low = mid + 1 # move bottom marker up return -1 # no range left to search, # x is not there

• bsearch.py
• search1.py
• search2.py
• search3.py
• search4.py
• stats.py
• time_search.py
• time_search_datasize_n.py

---