(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 Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Patrick Rodgers, "array search", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/arraysearch.html