(classic problem)
Definition: Find an element in an array. Various algorithms exist which require more or less structure in the array elements or implementation.
See also linear search, binary search, interpolation search, string matching.
Note: An external index, such as a hash table or inverted index may help make the search quicker and speed overall processing if the array is not changed often.
Author: PR
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:02:14 2004.
HTML page formatted Wed Oct 26 09:47:11 2005.
Cite this as:
Patrick Rodgers, "array search", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/arraysearch.html
