Take clues from the problem statement:
... find all occurrences of the pattern in the text.
The statement suggests two levels of computation:
- Checking whether the pattern occurs at a particular position in the text; and
- Checking for occurrence of the pattern at all other positions in the text.
We develop a pattern
matching algorithm by successive refinement.
Last Updated 01/05/2000
© L.Heath, 2000