UT Austin Computer Science company blog
The Boyer-Moore Fast String Searching Algorithm
Our algorithm has the peculiar property that, roughly speaking, the longer the pattern is, the faster the algorithm goes. Furthermore, the algorithm is ``sublinear'' in the sense that it generally looks at fewer characters than it passes. The algorithm is described in
- Points
- 228
- HN comments
- 81
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2021
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Apr 23, 2021 | The Boyer-Moore Fast String Searching Algorithm by js2 | 228 | 81 |
