brute force string search

(algorithm)

Definition: Find a string in another string or body of text by trying each position one at a time. There are many far faster string matching algorithms.

Also known as naive string search.

Generalization (I am a kind of ...)
string matching, brute force.

Aggregate parent (I am a part of or used in ...)
strsrch.

Author: PEB

Implementation

Christian Charras' and Thierry Lecroq's Exact String Matching Algorithms (C), (C and Pascal)

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 12 February 2019.
HTML page formatted Wed Oct 30 12:15:30 2024.

Cite this as:
Paul E. Black, "brute force string search", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bruteForceStringSearch.html