Knuth–Morris–Pratt algorithm: Difference between revisions

Content deleted Content added
External links: KMP is an advanced algorithm. I wanted to share a link to an article which explains the search time complexity of KMP with concrete examples & detailed steps. It should be helpful to new learners.
Hwlang (talk | contribs)
m External links: Link corrected
Line 459:
* [http://www.ics.uci.edu/~eppstein/161/960227.html An explanation of the algorithm] and [http://www.ics.uci.edu/~eppstein/161/kmp/ sample C++ code] by [[David Eppstein]]
* [http://www-igm.univ-mlv.fr/~lecroq/string/node8.html Knuth-Morris-Pratt algorithm] description and C code by Christian Charras and Thierry Lecroq
* [http://www.inf.fhhs-flensburg.de/lang/algorithmen/pattern/kmpen.htm Explanation of the algorithm from scratch] by FH FlensburgH.W. Lang
* [https://web.archive.org/web/20101227102334/http://oak.cs.ucla.edu/cs144/examples/KMPSearch.html Breaking down steps of running KMP] by Chu-Cheng Hsieh.
* [https://www.youtube.com/watch?v=Zj_er99KMb8 NPTELHRD YouTube lecture video]