Skip to content
#

knuth-morris-pratt

Here are 60 public repositories matching this topic...

The Knuth-Morris-Pratt (KMP) Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a preprocessing step to create a failure function, which helps skip irrelevant comparisons and improves its efficiency compared to a simple string matching algorithm.

  • Updated Feb 13, 2023
  • Kotlin

The Knuth-Morris-Pratt (KMP) algorithm is a linear time pattern matching algorithm that efficiently searches for occurrences of a pattern in a text. It pre-processes the pattern to determine a partial match table which is used to quickly skip over sections of the text that cannot match the pattern.

  • Updated Feb 10, 2023
  • Kotlin
search-and-sort

Julia and Python search algorithm implementation including Bloom Filter, Aho-Corasick, Boyer-Moore, Knuth-Morris-Pratt, Rabin-Karp, Binary & Sequential; hash algorithm implementation including Fowler-Noll-Vo-1, Jenkins One-at-a-time, Hash Chaining, Linear Probing & Quadratic Probing; sort algorithm implementation including Cocktail, Bitonic, Gno…

  • Updated Jul 21, 2022
  • Julia

Improve this page

Add a description, image, and links to the knuth-morris-pratt topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the knuth-morris-pratt topic, visit your repo's landing page and select "manage topics."

Learn more