Pattern matching algorithm implemented in C ++

# Include <iostream. h>
# Include <string. h>
Int index (char * s, char * t, int POS)
// Return the position of the substring T following the POs character in the primary string S.
// If not, the return value of the function is 0.
// Where T is not empty, 1 <= POS <= strlen (s)
{
Int I = Pos;
Int J = 1;
While (I <= strlen (s) & J <= strlen (t ))
{
If (s [I-1] = T [J-1]) // continue to compare subsequent characters
{
++ I;
++ J;
}
Else // returns the pointer and starts matching again.
{
I = I-j + 2;
J = 1;
}
}
If (j> strlen (t ))
Return I-strlen (t );
Else
Return 0;
}
Void main () // main function, used to test the pattern matching algorithm
{
Char * A = "ahdindfce ";
Char * B = "IND ";
Cout <index (a, B, 0)> <Endl;
}