Naive Pattern Searching Algorithm

Naive Pattern Search algorithm as the name suggests is a very naive method of searching a pattern. The naive logic is to compare every instance of the pattern with every instance of the text.

Algorithm

for i in range 0 to N-M # Primary Comparison of the # Sample text with Pattern for j in range 0 to M; if text[i+j]!=pat[j] break; # Implies that j loop has traversed # to the last instance of the pattern, # and all comparisons are matching if(j==M) print("Instance found at:"i+1) Where N is the Length of the text and M is the Length of the pattern

Naive algorithm is not an optimized solution because the complexity is O(n^2). We need better and more optimized solutions.

Source Code: NaiveSearchAlgo