Mod 4

Page 1

String matching

1) Bruteforce algorithm

Algorithm BruteForceMatch(T,P):

Input: Strings T (text) with n characters and P (Pattern) with m characters

Output: Starting index of the first substring of T matching P, or an indication that P is not a substring of T

//Outer loop is indexing throught all possible starting indices

//Inner loop indexing through each character of the pattern

for i j while (j j if j=m then

return i

return "There is no substring of T matching P."