Algorithm complexity project
Knuth–Morris–Pratt string-searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.
The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris. This was the first linear-time algorithm for string matching
- JFoenix (material design library)
- FontAwesome-Fx (icons library)
| KMP Main program |
|---|
 |
| KMP Main program with index |
|---|
 |
| Demo Graph for demonstration time of KMP Algorithm time vs Brute Force Algorithm time |
|---|
 |