Revision as of 23:00, 28 September 2024 edit AltoStev (talk \| contribs) Extended confirmed users 1,166 edits →Why does this work?: new section Tag: New topic ← Previous edit		Revision as of 23:40, 28 September 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits →Why does this work?: Reply Tag: Reply Next edit →
Line 262: The hash function suggested in [[Rabin–Karp algorithm#Hash function used]] goes over each character. So I don't see how using the hash is faster than just comparing each character  [[User:AltoStev\|<span style='color: orange;'>'''AltoStev'''</span>]] ([[User Talk:AltoStev\|<span style='color: #448cff'>talk</span>]]) 23:00, 28 September 2024 (UTC) :Comparing each character to what? A naive search would compare each pair of (position in first string, position in second string). That could be a lot more pairs than characters. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 23:40, 28 September 2024 (UTC)

Talk:Rabin–Karp algorithm: Difference between revisions