A written description of a binary search algorithm is: Start by setting the counter to the middle position in the list. If the value held there is a match, the search ends and a message is sent.