binary search

Binary search is a way of searching for something in a list. It works like this: first, you imagine that the list has been split right down the middle into two parts. You then decide which part of the list the thing you're looking for is in, and you split that half in the same way. Then you split the half you chose in half again - and so on until you find the item. It's like a game of 'hotter-colder', where choosing the right option each time takes you closer to the item you're looking for.