Used with a SORTED list. Look at middle element and compare to what we are searching for. If not the middle, repeat with the half of the list our element will be in. If the list is not sorted, try sequential/linear search instead.
Complexity:
best = O(1), [middle element]
avg/worst = O(log n)
Found in lecture Chapter 1 - Alg 2