Revision as of 04:28, 25 November 2024 edit AltoStev (talk \| contribs) Extended confirmed users 1,166 edits →Why does this work?: acknowledge completion Tag: 2017 wikitext editor ← Previous edit		Latest revision as of 14:09, 23 June 2025 edit undo AmirOnWiki (talk \| contribs) 401 edits →Probabilistic analysis: new section Tag: New topic
Line 267: ::Oh I see what you mean. I meant, for each index i, the pair (s[i], s_2[i]).  [[User:AltoStev\|<span style='color: orange;'>'''AltoStev'''</span>]] ([[User Talk:AltoStev\|<span style='color: #448cff'>talk</span>]]) 12:20, 30 September 2024 (UTC) :::But that would only test two strings for equality. This algorithm tests whether one is a substring of the other, at any position. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 20:17, 30 September 2024 (UTC) == Probabilistic analysis == There is a vauge statement that the expected time of the algorithm is linear. It would be nice if someone can flesh this out. [[User:AmirOnWiki\|AmirOnWiki]] ([[User talk:AmirOnWiki\|talk]]) 14:09, 23 June 2025 (UTC)

Talk:Rabin–Karp algorithm: Difference between revisions