Horspool’s algorithm shifts the pattern by looking up shift value in the character of the text aligned with the last character of the pattern in table made during the initialization of the algorithm. I failed the whole evening to calculate a simple shift table for the search term anabanana for use in the Boyer and Moore pattern matching algorithm. Please describe the construction process of the matching table and the main algorithm in a naive way. Boyer and Moore algorithm, shift table calculation.
Horspool Algorithm is used to search the pattern in the given string using a shift table. Its another variation of the Boyer-Moore Algorithm where it uses two shift tables – bad shift table and good suffix table but in Horspool Algorithm we are using just one shift table to search the pattern in the given string.