Y
Hacker News
new
|
ask
|
show
|
jobs
by
User23
1306 days ago
Is there some better alternative to Knuth-Morris-Pratt or Boyer-Moore? Both can easily be adapted to regular expression matching and as far as I know there’s no faster algorithm that doesn’t do preprocessing.