The Z Algorithm is a linear-time string matching algorithm used to find all the occurrences of a pattern string in a text string. It uses a preprocessing step to create a Z array, which stores the length of the longest common prefix of the text and a suffix starting from a specific position.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Z Algorithm is a linear-time string matching algorithm used to find all the occurrences of a pattern string in a text string. It uses a preprocessing step to create a Z array, which stores the length of the longest common prefix of the text and a suffix starting from a specific position.
darian-catalin-cucer/z-algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
The Z Algorithm is a linear-time string matching algorithm used to find all the occurrences of a pattern string in a text string. It uses a preprocessing step to create a Z array, which stores the length of the longest common prefix of the text and a suffix starting from a specific position.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published