Substring algorithm

Question

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

The problem: given two strings S=S₁S₂S₃…S_n and T=T₁T₂T₃…T_m, with m is less than or equal to n, determine if T is a substring of S.

Answer 1

Here's a list of string searching algorithms

Depending on your needs, a different algorithm may be a better fit, but Boyer-Moore is a popular choice.