Answer to Question #265540 in C++ for Usama

Question

Consider the following list: 2 10 17 45 49 55 68 85 92 98 110 Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? Show the values of first, last, and middle and the number of comparisons after each iteration of the loop. 

Answer 1

a. 15

b. 49

c. 98

d. 99