02/21/00
COM1100 Winter2000 Yuhong Yin
7
Binary Search
nIn a binary search, the list must be in sorted order.
nThe desired item is first compared to the element in the middle of the list (for lists with an even number of elements,
either of the two middle elements can be used).
nThree possibilities present once the comparison is made:
nCase 1: the desired item may be equal to the middle element,
nCase 2: it may be greater than the middle element,
nCase 3: or it may be less than the middle element.