Search results

1 package found

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.

published version 1.0.1, 7 years ago0 dependents licensed under $MIT
96