3 ms·
Quicksearch: The Fastest/Simplest Sublinear String Search Algorithm
- bugfix-66 4y agoChange lo = hi + 1 + t[tip] to lo = hi + 1 - t[tip] to fix the bug. Almost the same algorithm, but in C instead of Go: https://www-igm.univ-mlv.fr/~lecroq/string/node19.html https://www-igm.univ-mlv.fr/~lecroq/string/node19.html