binary search


Also found in: Dictionary, Thesaurus, Medical, Wikipedia.

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 ?
upsilon]] is large, the difference between the height and the saturation level should be smaller for the Lyndon tree than for the binary search tree.
Thanks to the binary search tree insertion algorithm the equivalence classes are in natural bijection with binary search trees.
right) binary search tree, and its Q-symbol, a decreasing binary tree.
We recently showed that Janson's approach could also be applied for the random binary search tree [6] .
Martingales and large deviations for binary search trees.
In the following, we distinguish the nodes that constitute the high-level trie structure from the slots which make the low-level structure of a node, whether this latter be a linked-list or a binary search tree.
In (Nei02) the Wiener index of random binary search trees and random recursive trees was studied with respect to limit laws.
From a binary search tree T, one can construct bijectively two labelled forests of ordered trees: the final forest [F.
No 30-second download clip or binary search engine result can ever give you the same feel for a song.
In their test, the researchers used a binary search process that can rule out half of the possible numbers at a time.
3 Data structures and algorithms / Binary search tree concept map
Additional topics include structures, queues, lists, recursion, searching and sorting, trees and binary search trees, graphs, hashing, and sets and maps.