Searching for the needle in a haystack is easy because we have the algorithm by Boyer, Moore and Horspool.
-
Updated
Nov 1, 2026 - Visual Basic 6.0
Searching for the needle in a haystack is easy because we have the algorithm by Boyer, Moore and Horspool.
Pattern matching using Horspool's algorithm
Comparative analysis of Brute-force, Horspool's, and Boyer-Moore string matching algorithms.
Implementation and performance comparison of Boyer Moore, Horspool and Brute Force in c programming language.
[EN] Implementation of the Boyer-Moore-Horspool algorithm / [FR] Implémentation de l'algorithme Boyer-Moore-Horspool
C Programs - Simple C programs
A highly optimized C implementation of the Boyer-Moore-Horspool string search algorithm. Supports dynamic file loading, line/index tracking, interactive CLI prompting, and quote stripping for file paths.
Various string search and Fuzzy String Matching algorithms. It contains implementations of Horspool, Boyer-Moore, Rabin-Karp as well as Brute Force algorithms for exact string matching. For Fuzzy Matching, it contains Hamming and Levenshtein Distance algorithms.
Java implementation and performance comparison of Brute Force, Horspool, and Boyer-Moore string matching algorithms.
Implementation of evaluation with Bayesian optimization strategy for Wu-Manber, Aho-Carasic, Horspool search algorithms
To associate your repository with the horspool topic, visit your repo's landing page and select "manage topics."