npmjs.org : z-algorithm : 1.0.1

This algorithm finds all occurrences of a pattern in a text in linear time. Let length of text be n and of pattern be m, then total time taken is O(m + n) with linear space complexity.

Registry - Download - JSON
purl: pkg:npm/[email protected]
Published: almost 7 years ago
Indexed: about 3 years ago