Revision as of 12:09, 30 September 2024 edit AltoStev (talk \| contribs) Extended confirmed users 1,166 edits →Why does this work?: Reply Tag: Reply ← Previous edit		Revision as of 12:20, 30 September 2024 edit undo AltoStev (talk \| contribs) Extended confirmed users 1,166 edits →Why does this work?: Reply Tag: Reply Next edit →
Line 265: :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) ::That would be the same amount of pairs as characters, as the number of pairs is equal to the number of positions, which is equal to the number of characters in the string.  [[User:AltoStev\|<span style='color: orange;'>'''AltoStev'''</span>]] ([[User Talk:AltoStev\|<span style='color: #448cff'>talk</span>]]) 12:09, 30 September 2024 (UTC) :::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)

Talk:Rabin–Karp algorithm: Difference between revisions