Binary search

Computing

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?

What card would you need to search for, for the best-case scenario to occur?

What card would you need to search for, for the worst-case scenario to occur?

How many comparisons would it take to work out that a card wasn’t in the set of cards?

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