GitHub / darian-catalin-cucer / knuth-morris-pratt

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.

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fknuth-morris-pratt

Topics: algorithm, algorithms-and-data-structures, android, box, go, html, java, javascript, js, kmm, kmp, knuth-algorithm, knuth-algorithm-x, knuth-morris-pratt, knuth-shuffling-algorithm, kotlin, mobile, ruby

Files

No dependencies found