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 to improve efficiency, making the KMP algorithm faster than other basic string matching algorithms.
-
Notifications
You must be signed in to change notification settings - Fork 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 to improve efficiency, making the KMP algorithm faster than other basic string matching algorithms.
darian-catalin-cucer/KMP
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
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 to improve efficiency, making the KMP algorithm faster than other basic string matching algorithms.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published