Dennis Yurichev personal blog
Knuth-Morris-Pratt string-searching algorithm: DFA-less version
You see, there are two memory accesses per one character of the input string (at average). Hence, the total number of all memory accesses can be len*2 at worst.
- Points
- 109
- HN comments
- 38
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2021
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jan 21, 2021 | Knuth-Morris-Pratt string-searching algorithm: DFA-less version by ingve | 109 | 38 |
