An implementation of the Rabin-Karp algorithm

RabinKarp.py

def RabinKarp(string, sub):
    n, m = len(string), len(sub)
    for i in range(0,n-m+1):
        for j in range(0,m):
            if string[i+j] != sub[j]:
                break
        else:
            return i
    return -1