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.
karimationabout 3 years agoz-algorithm, pattern-searching-algorithm, filter-search-box, string