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.
Example http://www-igm.univ-mlv.fr/~lecroq/string/examples/exp18.html
Compare to StringFinder project, HorspoolStringSearch is a more efficient way to search for string,