Definition: Search an array or list by checking items one at a time.
Also known as sequential search.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
transpose sequential search.
Aggregate child (... is a part of or used in me.)
See also binary search, hash table.
Note: Average run time is Θ (n/2) when the item is found.
expected time. Demonstration.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 16 November 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.
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. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/linearSearch.html