Skip to content

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.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/knuth-morris-pratt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

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.

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, which helps skip irrelevant comparisons and improves its efficiency compared to a simple string matching algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages