BF algorithm and KMP Algorithm

///   <Summary>
/// Brute-forceAlgorithm
///   </Summary>
///   <Param name = "S"> Parent string </Param>
///   <Param name = "T"> Substring </Param>
///   <Returns> Index of the Child string on the parent string </Returns>
Public Static Int BF ( String S, String T)
{
Int I = 0 , J = 0 ;
For (; I <S. Length & J <t. length ;)
{
If (S [I] = T [J])
{
I ++;
J ++;
}
Else
{
I = I-j + 1 ;
J = 0 ;
}
}
If (J = T. length)
{
Return I-t. length;
}
Else
{
Return - 1 ;
}

}