Explain naive string matching algorithm with example.

21kviews

written 7.8 years ago by

teamques10 ★ 65k

• modified 4.1 years ago

ADD COMMENT EDIT

1 Answer

490views

written 7.8 years ago by

teamques10 ★ 65k

The naive algorithm finds all valid shifts using a loop that checks the condition P [1 . . m] = T[s + 1 . . s + m] for each of the n - m + 1 possible values of s.
NAIVE-STRING-MATCHER(T, P)
```
1 n   length [T]
2 m   length …
```

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.