Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

See also

Binary Search, Sorting, Tabu Search, Tree Searching

Explore with Wolfram|Alpha


Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, 1973.Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. "How to Search an Ordered Table." §3.4 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 110-113, 1992.Skiena, S. "Sorting and Searching." §1.1.6 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 14-16, 1990.

Referenced on Wolfram|Alpha


Cite this as:

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

Subject classifications