The Probert Encyclopaedia of Science & Technology

BINARY SEARCH

A binary search is a fast system of searching a sorted list. The basic principle is that each comparison divides the remaining list into two. The first search commences at the middle of the list, and determines if the desired key is in the first or last half. The next comparison occurs half way through the half determined by the previous comparison, and so on until either a matching key is located, or the search fails because no matching key is included in the list.
Research Binary Search