Definition: Find occurrences of a substring in a target string by trying the substring at each possible location in the string. Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.
Generalization (I am a kind of ...)
Aggregate child (... is a part of or used in me.)
brute force string search.
Note: This is a C implementation of an APL routine. There are far faster algorithms at string matching.
As written, the routine uses a fixed size array (15 in the article) to return matching locations. Hence it only returns the first 15 locations.
Sanford J. Hersh, String Searching in C, Computer Language, 5(12):63-65, December 1988.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 July 2018.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "strsrch", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 20 July 2018. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/strsrch.html