A METHOD OF STRING SEARCH

Abstract

This paper presents a simple algorithm for searching a word or a pattern of a length \(m\) characters in a text of \(n\) characters. It is a straightforward method which begins the searching with the word and the text aligned to the left ends. The number of comparisons to determine that the word is or it is not in the text in the worst unfavourable case, theoretically is of \(m(n-m+1)\). This seems to be faster than the direct method presented in [9].