Suppose that L is a sorted list of 4,096 elements. What is the maximum number of comparisons made by binary search to determine if an item is in L? (3)
Consider the following list:
5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 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. (3)
a. 32 b. 20 c. 105 d. 60