Talk:Boyer-Moore string search: Difference between revisions
m
update historical comment to link to historical view of what was being commented on
(Emacs Lisp incorrect?) |
m (update historical comment to link to historical view of what was being commented on) |
||
Line 1:
I am not sure if [https://rosettacode.org/mw/index.php?title=Boyer-Moore_string_search&oldid=362692 this] is intended to be a task.
I also am not sure how this algorithm's performance fairs against the caching mechanisms of recent machines. (Other than branch prediction issues, boyer-moore is probably not penalized by caching implementations -- unlike tree search algorithms which experience poor cache locality -- but there might be some minimum search string length necessary to see significant gains from this approach, especially in uncached contexts.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:13, 6 July 2022 (UTC)
| |||