Binary Search
If the list is sorted, we can use a binary search to find the target value
Strategy: examine the item in the middle of the list, eliminating half of the items from consideration
The target value will either be found, or will be in one half or the other
Continue the process, examining the middle item of the search section on each comparison
See Binary_Search_Test.java