, with length |P| = m and a text
string 
, with length |T| = n, where m,n > 0 and 
:
Given a pattern string , with length |P| = m and a text
string , with length |T| = n, where m,n > 0 and :
If P occurs as a substring of T, find the first occurrence--that is,
find s such that T[s+1..s+m] = P[1,m] ( 
).
