The Prague Stringology Club Workshop '98
On the All Occurrences of a Word in a Text
| Abstract: |
|
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: |  |
 |
| PostScript |