Talk:Boyer-Moore string search

Revision as of 01:13, 6 July 2022 by Rdm (talk | contribs) (Created page with "I am not sure if 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 bran...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

I am not sure if 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.) --Rdm (talk) 01:13, 6 July 2022 (UTC)

Return to "Boyer-Moore string search" page.