# binary search

Also found in: Dictionary, Thesaurus, Medical.

## binary search

[′bīn·ə·rē ′sərch]
(computer science)
A dichotomizing search in which the set of items to be searched is divided at each step into two equal, or nearly equal, parts. Also known as binary chop.

## binary search

(algorithm)
A search algorithm which repeatedly divides an ordered search space in half according to how the required (key) value compares with the middle element.

The following pseudo-C routine performs a binary search return the index of the element of vector "thing[first..last]" equal to "target":

if (target < thing[first] || target > thing[last]) return NOT_FOUND; while (first < last) mid = if (target == thing[last]) return last; return NOT_FOUND;

## binary search

A technique for quickly locating an item in a sequential list. The desired key is compared to the data in the middle of a sequential index or in the middle of a sequential file. The half that contains the data is then compared in the middle, and so on, either until the key is located or a small enough group is isolated to be sequentially searched. See binary.
References in periodicals archive ?
As it turns out that the application of binary search is much more than playing number-guessing games.
Instead, taking advantage of the binary search structure of the tree, it is possible to just traverse the tree in backward "in-order" as in Algorithm 4.
Binary Search Tree (BST) is a core data structure which is used for the management of ordered data and its manipulation operations (Cormen and Russel, 2009).
(ii) The random operation demonstrated by (4) is no longer suitable to binary search space.
This may be because the difference of the binary search algorithm in the [10.sup.6] and [10.sup.7] message spaces is not significant.
Asymptotic distribution of two-protected nodes in random binary search trees.
* After calculating the bidding value it will create a binary search tree based on the binary search tree algorithm.
If the parity of a block disagrees between Alice and Bob, they perform a binary search on that block with the aim of identifying the single bit error.
Here we assume the cleanup algorithm is to simply go through the pile, book by book, and find the right location for each book on the shelves via a binary search (see Remark 1.2 for a discussion of other cleanup algorithms).
From the encoding rule of Section 2.1, f is positioned in the interval [[r toot of (bot)], [r root of (top)]] through binary search each time in the process of successive approximation, where
To measure the overall productivity of binary searches, we also need to determine the administrative cost of the surveillance and, on the other side of the equation, the expected benefits of the surveillance.
In their test, the researchers used a binary search process that can rule out half of the possible numbers at a time.

Site: Follow: Share:
Open / Close