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 parent (I am a part of or used in ...)
Bond 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 Black.
Entry modified 6 April 2018.
HTML page formatted Fri Apr 6 11:20:42 2018.
Cite this as:
Paul E. Black, "linear search", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 April 2018. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/linearSearch.html