In a classical binary search, you'd start by checking one item (a 0 or 1 in binary terms) at a time. If the item you're searching for is not in the first location, you move on to the next, and so on.