Comparing searching algorithms

Computing

The sequence of items in the list can either be ordered or unordered.

If you double the number of items in the list, you will need at most one more comparison.

What does the initial value of -1 indicate?

When carrying out the binary search, does the data need to be ordered?

With each comparison, the binary search algorithm eliminates how of the data.

If the midpoint item is less than than the search item, do you change the range to focus on the items after or before the midpoint

When finding the item in the middle of the range (the midpoint item). If there is an even number of items, which item do you select?