Skip to content
/ kmp-algorithm Public

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.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

darian-catalin-cucer/kmp-algorithm

Error
Looks like something went wrong!

About

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.

Topics

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

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages