Boyer–Moore–Horspool algorithm

string search algorithm
Exact String Matching Algorithm Q4060665

Facts

6 properties

Identity

Instance of
exact string-matching algorithm
More facts +5
Publication date
1980[6]
Average time complexity
O(n)[8]
Worst-case time complexity
O(nm)[7]
🏷️ Also known as
en Boyer-Moore-Horspool algorithm en Boyer–Moore–Horspool algorithm en Horspool's algorithm fi Boyerin–Mooren–Horspoolin algoritmi fi Horspoolin algoritmi fr algorithme de Boyer-Moore-Horspool ja ボイヤー-ムーア-ホースプール法 ru Алгоритм Бойера — Мура — Хорспула ru Алгоритм Бойера-Мура-Хорспула th ขั้นตอนวิธีบอยเออร์–มัวร์–ฮอร์สพูล uk Алгоритм Бояра-Мура-Горспула
🔖 Identifiers · 3
Dictionary of Algorithms and Data Structures ID
Horspool, boyerMooreHorspool
Freebase ID
/m/05t8fw
Microsoft Academic ID (discontinued)
64388698

Report an error or request removal Lineage (PROV-JSON)

Press Enter · cited answer in seconds

Summary

Boyer–Moore–Horspool algorithm is an exact string-matching algorithm[1].

Body

History and Context

Things named after include Robert S. Boyer[2], an engineer[9], b. 2000[10], of United States[11], awarded the ACM Software System Award[12]; J Strother Moore[3], a computer scientist[13], b. 1947[14], of United States[15], awarded the ACM Software System Award[16]; and Nigel Horspool[4], a computer scientist[17], of Canada[18].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.

Inline context (facts about related entities)

  1. [9] ↑ . Wikidata. wikidata.org. → on this site
  2. [10] ↑ . Wikidata. wikidata.org. → on this site
  3. [11] ↑ . Wikidata. wikidata.org. → on this site
  4. [12] ↑ . Wikidata. wikidata.org. → on this site
  5. [13] ↑ . Wikidata. wikidata.org. → on this site
  6. [14] ↑ . Wikidata. wikidata.org. → on this site
  7. [15] ↑ . Wikidata. wikidata.org. → on this site
  8. [16] ↑ . Wikidata. wikidata.org. → on this site
  9. [17] ↑ . Wikidata. wikidata.org. → on this site
  10. [18] ↑ . Wikidata. wikidata.org. → on this site

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Boyer–Moore–Horspool algorithm. Retrieved November 16, 2026, from https://4ort.xyz/entity/boyer-moore-horspool-algorithm
MLA “Boyer–Moore–Horspool algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 16 Nov. 2026, https://4ort.xyz/entity/boyer-moore-horspool-algorithm.
BibTeX @misc{4ortxyz_boyer-moore-horspool-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Boyer–Moore–Horspool algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/boyer-moore-horspool-algorithm}, note = {Accessed: 2026-11-16}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Boyer–Moore–Horspool algorithm — https://4ort.xyz/entity/boyer-moore-horspool-algorithm (retrieved 2026-11-16)

Canonical URL: https://4ort.xyz/entity/boyer-moore-horspool-algorithm · Last refreshed: