[[MM]RoXoR[FS]]

Dont know if needed.
I was given this as homework in school. Converted for pawn(never tested for pawn).

This use a binary search, returns location of char.

pawn Код:

stock strfind(a[],find,bool:ignorecase = false,size = -1)
{
    if(size == -1) size = strlen(a);
    new i,j,loc = -1;
    for(i=0,j=size-1 ; i<size ;++i,--j)
    {
        if(ignorecase == true)
        {
                find = toupper(find);
                if(toupper(a[i]) == find) {loc= i; break;}
                if(toupper(a[j]) == find) {loc= j; break;}
        }
        else 
        {
                if(a[i] == find {loc =i;break; }
                if(a[j] == find{loc = j;break;}
        }
    }
    return (loc +1);
}