Talk:Rabin–Karp algorithm: Difference between revisions

Revision as of 10:16, 28 July 2005

Revision as of 14:14, 29 July 2005

Line 25:

As pointed out corretly in the single patters search - to rule out a hash collision we need to compare with the actual search string(s). (Plural only if by fat chance or denial of service attack, two search strings have the same hash.)

Or am I missing something obvious here?--[[User:ISee|ISeeiSee]] 10:16, 28 July 2005 (UTC)

:I need to correct myself. The code is ok, although I don't quite get how the rolling hash would compare varying key-lengths. I improved the code indentation so the code is more readable [[User:ISee|iSee]]