^Binary Search
~Given the following numbers in array A ...

13 20 22 23 29 37 42 50 53 57

... how many compares will it take to find the 37
using the Binary Search algorithm given in class.?
^Value 37 is at location 5 in 1 compares
Assume that the first number (13) is at location 0 in the array .


a.  1
b.  2
c.  9
d.  6
e.  None of the above []