Skip to content
#

knuth-algorithm

Star

Here are 25 public repositories matching this topic...

Language: All
Filter by language
All 25 Java 4 Python 4 C 2 C++ 2 Kotlin 2 OCaml 2 Common Lisp 1 Coq 1 Elixir 1 Go 1
Sort: Recently updated
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

darian-catalin-cucer / knuth-morris-pratt

Star 0

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.

javascript ruby android kotlin java go html algorithm mobile js box algorithms-and-data-structures knuth-morris-pratt knuth-algorithm kmp knuth-shuffling-algorithm kmm knuth-algorithm-x
  • Updated Feb 13, 2023
  • Kotlin

darian-catalin-cucer / kmp-algorithm

Star 1

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.

kotlin java html algorithm js algorithms cpp kmp-algorithm algorithm-challenges algorithms-datastructures algorithms-and-data-structures knuth-morris-pratt knuth-algorithm kmp kmm kmp-viewmodel
  • Updated Feb 10, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the knuth-algorithm 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-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more