String Searching Algorithms (Part II) | Java.net
Knuth-Morris-Pratt (KMP)
Overview
According to Wikipedia, the Knuth-Morris-Pratt 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".
Read full article from String Searching Algorithms (Part II) | Java.net
No comments:
Post a Comment