(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 parent (I am a part of or used in ...)
Bond 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 Black.
Entry modified 21 April 2022.
HTML page formatted Thu Apr 21 14:52:02 2022.
Cite this as:
Paul E. Black, "linear search", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 21 April 2022. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/linearSearch.html