substrings_search_Rabin_Karp_wc_test_en.py

#Good old worst-case for naive algorithm. Let's run Rabin-Karp on it.
import time
needle = 'a'*1000 + 'b'
haystack = 'a'*10000 + 'b'
result = []

start = time.time()
for i in range(50):
    result = search_Rabin_Karp(needle, haystack)
end = time.time()
print('Positions:',result)
print('Time elapsed:',end-start)
#Example output:
#Positions: [9000]
#Time elapsed: 0.8732948303222656