3 ms·
Wikipedia says Boyer Moore is O(n+m) which is the same as this algorithm. https://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm#Performance https:/
by pedrocr 12y ago
Wikipedia says Boyer Moore is O(n+m) which is the same as this algorithm.
https://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm#Performance https://en.wikipedia.org/wiki/Boyer-Moore_string_search_algo...
- mightybyte 12y agoThat's worst case complexity. It's the average case where Boyer Moore wins over KMP.