substrings_search_naive_wc_test_en.py

#Worst case test of naive substring search    
import time
needle = 'a'*1000 + 'b' #so we search for a string with 1000 times letter 'a' and one letter 'b' at the end
haystack = 'a'*10000 + 'b' #and the haystack is almost like this, but longer
result = []

start = time.time()
for i in range(50): #we repeat 50 times just to better track time
    result = search_naive(needle, haystack)
end = time.time()
print('Positions:',result)
print('Time elapsed:',end-start)
#Example output on my machine:
#Positions: [9000]
#Time elapsed: 94.60738587379456