One of the first videos I ever watched on computer science revolved around a question that follows the same premise of this game. How would you most efficiently sort through a phone book to find someones last name that starts with (x (variable)). Well computationally speaking, the best method is to split the data pool in half, is the letter in the bottom half or top half? Disregard the unneeded section and repeat until you find the phone number.
Attempts: