Boyer–Moore–Horspool algorithm
Facts
6 propertiesIdentity
- Instance of
- exact string-matching algorithm
More facts +5
- Publication date
- 1980[6]
- Average time complexity
- O(n)[8]
- Named after
- Robert S. Boyer, J Strother Moore, Nigel Horspool[2][3][4]
- Worst-case time complexity
- O(nm)[7]
- Dictionary of Algorithms and Data Structures ID
- Horspool, boyerMooreHorspool
- Freebase ID
- /m/05t8fw
- Microsoft Academic ID (discontinued)
- 64388698
Named after 3
Based on 1
0 sources
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].