GitHub / darian-catalin-cucer / kmp-algorithm
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fkmp-algorithm
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Kotlin
Size: 1.95 KB
Dependencies parsed at: Pending
Created at: about 2 years ago
Updated at: about 2 years ago
Pushed at: about 2 years ago
Last synced at: about 2 years ago
Topics: algorithm, algorithm-challenges, algorithms, algorithms-and-data-structures, algorithms-datastructures, cpp, html, java, js, kmm, kmp, kmp-algorithm, kmp-viewmodel, knuth-algorithm, knuth-morris-pratt, kotlin