Reference no: EM133266203

Assume you're given the sorted list of numbers below, and you're trying to determine whether the value 75 is included in the list or not:

3 8 12 19 28 45 47 54 73 79 88 106 125 142 161

1. Which values would you need to check (in order) if you were using linear search to answer this question? Begin the search with the lowest value in the list. Assume your linear search algorithm knows the list is sorted, and can use that fact to be as computationally efficient as possible.

2. If you were using the same efficient linear search algorithm from part a), but instead started with the greatest value in the list and proceeded to the left, what is the last value you would need to check before returning an answer?

3. Which values would you need to check (in order) if you were using binary search to answer this question?