(algorithm)
Definition: Search an array or list by checking items one at a time.
Also known as sequential search.
Generalization (I am a kind of ...)
search.
Specialization (... is a kind of me.)
transpose sequential search.
Aggregate child (... is a part of or used in me.)
move-to-front heuristic.
See also binary search, hash table.
Note: Average run time is Θ (n/2) when the item is found.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 30 September 2009.
HTML page formatted Wed Sep 30 13:22:29 2009.
Cite this as:
Paul E. Black, "linear search", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 30 September 2009. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/linearSearch.html
