Binary Search

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating the procedure iteratively.

See also


Explore with Wolfram|Alpha


Lewis, G. N.; Boynton, N. J.; and Burton, F. W. "Expected Complexity of Fast Search with Uniformly Distributed Data." Inform. Proc. Let. 13, 4-7, 1981.Skiena, S. "Backtracking and Distinct Permutations." §1.1.5 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 12-14, 1990.

Referenced on Wolfram|Alpha

Binary Search

Cite this as:

Weisstein, Eric W. "Binary Search." From MathWorld--A Wolfram Web Resource.

Subject classifications