4.4. Knuth Morris Pratt (KMP 알고리즘)

CS - 4. String Search and Manipulations - 4.4. Knuth morris pratt Knuth Morris Pratt 💡Knuth morris pratt is a string searching algorithm that uses a precomputed array to find the substring in a string. This array is known as the prefix function. The prefix function is the longest prefix that is also a suffix of a substring. The prefix function is used to skip the characters that are already matc..

2024.02.20