File kmp_str_search.py

kmp_str_search.py:None–None · view source on GitHub ↗

Source from the content-addressed store, hash-verified

1	"""Author Anurag Kumar(mailto:anuragkumarak95@gmail.com)
2	The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of te$
3	with complexity O(n + m)
4	1) Preprocess pattern to identify any suffixes that are identical to prefix$

nothing calls this directly

kmpFunction · 0.85

no test coverage detected