boyer-moore
- Text
- boyer-moore is a string-search algorithm (1977) that compares the pattern right to left and skips ahead using bad-character and good-suffix tables; sublinear on average, the basis of most fast grep implementations.
- Tags
- academic, performance