fast way to compare 2 ranges of a astring

I want to find the fastest way to compare 2 ranges of a string. I guess there must be some type of binary algorithm probably.

string s;
int i, j , k , l;

//want to compare characters from s[i..j] to characters s[k..l]