Notes/Lecture_Notes
1
0
Fork 0
mirror of https://github.com/dholerobin/Lecture_Notes.git synced 2025-09-13 05:42:12 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update KMP.md

Browse Source
This commit is contained in:
Aakash Panchal
2020-06-12 22:17:37 +05:30
committed by GitHub
parent 2975f082ac
commit 0602c16dc3
1 changed files with 3 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
articles/Akash Articles/md/KMP.md
View File

@@ -1,6 +1,6 @@
Prefix function and KMP-algorithm Prefix function and KMP-algorithm
KMP-algorithm is a widely used **string-matching algorithm**, which is used to find a place where a string is found within a larger string. It uses the value of **prefix function** for a given string. KMP-algorithm is a widely used **string-matching algorithm**, which is used to find a place where a string is found within a larger string. For example, `p = "ab"` and `s = "abbbabab"`, then KMP will find us `[0,4,6]` because $s$ has 3 occurrences of `"ab"`. It uses the value of **prefix function** to do so.
Let's first see what is a **prefix function**. Let's first see what is a **prefix function**.
@@ -214,6 +214,8 @@ int main()
} }
``` ```
Prefix function can also be used to solve various string related problems. Let's see some applications.
## Find a period of a string ## Find a period of a string
Period of a string is the shortest length such that a larger string $s$ can be represented as a concatenation of one or more copies of a substring($t$). Period of a string is the shortest length such that a larger string $s$ can be represented as a concatenation of one or more copies of a substring($t$).