A new proof of the linearity of the Boyer-Moore string searching algorithm

In this paper we analyze the worst case performance of the Boyer-Moore string searching algorithm [2]. We work within the paradigm of algorithmic analysis initiated by Knuth, that is we develop a mathematical theory dealing with the behavior of a specific (and practical) algori thm. Other algori thms whose analysis has resulted in siginificant mathematical developments are the Union-Find algorithm [10], QuickSort [9], Double Hashing [3], and others. For a more general treatment of algorithmic analysis of combinatorial problems see [1], [5], [6].