Definition: An algorithm to find a string within 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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 November 2009.
HTML page formatted Mon Nov 18 10:44:09 2013.
Cite this as:
Paul E. Black, "brute force string search", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bruteForceStringSearch.html