I'm currently working with some big text files (books).
does anyone know how python's "str in str" is implemented / time-complexity?
e.g:
'bc' in 'abcde'
I'm trying to find out the worst case and the avg. case
Thanks!
Asked
Active
Viewed 114 times
2
-
It is explained here http://effbot.org/zone/stringlib.htm – Padraic Cunningham Dec 26 '15 at 18:59
-
https://github.com/python/cpython/blob/master/Objects/stringlib/fastsearch.h – Padraic Cunningham Dec 26 '15 at 19:08