Substring algorithm

Question

Can someone explain to me how to solve the substring problem iteratively?

The problem: given two strings S=S₁S₂S

Answer 1

This may be redundant with the above list of substring algorithms, but I was always amused by KMP (http://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm)