String matchingHorspool algorithm 
The BoyerMoore algorithm uses two heuristics in order to determine the shift distance of the pattern in case of a mismatch: the badcharacter and the goodsuffix heuristics. Since the goodsuffix heuristics is rather complicated to implement there is a need for a simple algorithm that is based merely on the badcharacter heuristics. Due to an idea of Horspool [Hor 80], instead of the "bad character" that caused the mismatch, in each case the rightmost character of the current text window is used for determining the shift distance.
Example:

 
(a) BoyerMoore  (b) Horspool  
In this example, t_{0}, ..., t_{4} = a b c a b is the current text window that is compared with the pattern. Its suffix a b has matched, but the comparison ca causes a mismatch. The badcharacter heuristics of the BoyerMoore algorithm (a) uses the "bad" text character c to determine the shift distance. The Horspool algorithm (b) uses the rightmost character b of the current text window. The pattern can be shifted until the rightmost occurrence of b in the pattern matches the text character b, where the occurence at the last position of the pattern does not count.
Like the BoyerMoore algorithm, the Horspool algorithm assumes its best case if every time in the first comparison a text symbol is found that does not occur at all in the pattern. Then the algorithm performs just O(n/m) comparisons.
The function occ required for the badcharacter heuristics is computed slightly different as in the BoyerMoore algorithm. For every alphabet symbol a, the function value occ(p, a) is equal to the rightmost position of a in p_{0} ... p_{m2}, or 1, if a does not occur at all. Observe that the last symbol p_{m1} of the pattern is not taken into account.
Example:
The occurrence function for a certain pattern p is stored in an array occ that is indexed by the alphabet symbols. For every symbol a A the entry occ[a] holds the corresponding function value occ(p, a).
Given a pattern p, the following function horspoolInitocc computes the occurrence function.
void horspoolInitocc() { int j; char a; for (a=0; a<alphabetsize; a++) occ[a]=1; for (j=0; j<m1; j++) { a=p[j]; occ[a]=j; } } 
As in the BoyerMoore algorithm, the pattern is compared from right to left with the text. After a complete match or in case of a mismatch, the pattern is shifted according to the precomputed function occ.
void horspoolSearch() { int i=0, j; while (i<=nm) { j=m1; while (j>=0 && p[j]==t[i+j]) j; if (j<0) report(i); i+=m1; i=occ[t[i]]; } } 
[Hor 80]  R.N. Horspool: Practical Fast Searching in Strings. Software  Practice and Experience 10, 501506 (1980) 
[Web 1]  http://wwwigm.univmlv.fr/~lecroq/string/  
[Web 2]  http://www.inf.fhflensburg.de/lang/algorithmen/pattern/stringmatchingclasses/HorspoolStringMatcher.java Horspool algorithm as a Java class source file 
Next: [Sunday algorithm] or 
H.W. Lang Hochschule Flensburg lang@hsflensburg.de Impressum Datenschutz © Created: 22.02.2001 Updated: 04.06.2018 