NIST

linear search

(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

Implementation

(C). Flower Brackets' implementation in (Java).

More information

expected time.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 April 2019.
HTML page formatted Mon Apr 22 12:17:39 2019.

Cite this as:
Paul E. Black, "linear search", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 April 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/linearSearch.html