KMP Algorithm
Knuth-Morris-Pratt pattern search in $O(n + m)$ using a prefix (failure) function.
Advanced
Never re-examines text characters — useful for streaming input such as serial data.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.