(algorithm)
Definition: To look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches.
See also array, binary search, B-tree, dictionary, hash table, heap, inverted index, linked list, quadtree, select kth element, linear search, string matching, select and partition.
Note: For more information, see the data structure in question or terms related to searching.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "search", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/search.html
