Implementation of KMP algorithm in C Language

I still don't understand the KMP algorithm, so I have to say this is an awesome algorithm.

Put it here for later viewing

Int Index_KMP (const char * str, const char * t)

{
Int str_size = strlen (str );
Int t_size = strlen (t );

Int * next = new int [t_size];
GetNext (t, next, t_size );
Int I = 0, j = 0;
While (I <str_size & j <t_size)
{
If (j =-1 | str [I] = t [j])
{
++ J;
++ I;
}
Else j = next [j];
}
If (j = t_size)
{
Return I-j;
}
Else return-1;

}

Void GetNext (const char * t, int * & next, int size)
{
Int I = 0, j =-1;
Next [0] =-1;
While (I <size)
{
If (j =-1 | t [I] = t [j])
{
++ I;
++ J;
If (t [I]! = T [j])
{
Next [I] = j;
}
Else next [I] = next [j];
}
Else j = next [j];
}
}