The Prague Stringology Club Workshop '98

O.C. Dogaru

On the All Occurrences of a Word in a Text

In this paper a simple straight string search algorithm is presented. For a string s that consists of n characters and a pattern p that consists of m characters the order of comparisons is O(n.m), 0

Download paper: Article in PostScript Article in PDF
 PostScript   PDF