Java implementation of the Knuth-Morris-Pratt (KMP) algorithm for efficient pattern matching in sequences.
Achieves O(n+m) time complexity through prefix-function computation, avoiding unnecessary character comparisons.
Newer Version Available
Licenses
| License | URL |
|---|---|
| Apache License, Version 2.0 | https://www.apache.org/licenses/LICENSE-2.0.txt |
Developers
| Name | Dev Id | Roles | Organization | |
|---|---|---|---|---|
| Zhitron | zhitron<at>foxmail.com | | Zhitron |