The entries in table are stored in alphabetically or numerically increasing order. The approximate middle entry of the table is located, and its key value is examined. If its value is too high, then the key value of middle entry of first half of table is examined and procedure is repeated on first half until the required item is found. If value is too low, then key of middle entry of second half of the table is tried and procedure is repeated on second half.