•Binary
search
–Only
used with sorted arrays
–Compare
middle element with key
•If
equal, match found
•If
key < middle
–Repeat
search on first half of array
•If
key > middle
–Repeat
search on last half
–Very
fast
•At
most N steps, where 2 > # of
elements
•30
element array takes at most 5 steps
–2 >
30
•