In a nutshell
Naïve string matching looks for a pattern inside a longer text by lining the pattern up at the first position and comparing character by character. On any mismatch it shifts the pattern one place right and starts over from the beginning. It needs no setup, but because each shift re-checks characters it may have already compared, it can do up to (text length × pattern length) comparisons.