Talk:Aho–Corasick algorithm: Difference between revisions

Content deleted Content added
Line 70:
::Removed "quadratic". I think that the original statement implied that as the length extends, so does the potential number of entries in the dictionary. [[User:Викидим|Викидим]] ([[User talk:Викидим|talk]]) 23:39, 9 October 2024 (UTC)
:::I've made one more clarification. I think it's important to point out that, unlike with Knuth-Morris-Pratt, you cannot expect complexity linear in the length of the input, so linear in the length of input + output is the best possible. [[User:Al-Quaknaa|Martin Koutecký]] ([[User talk:Al-Quaknaa|talk]]) 11:11, 10 October 2024 (UTC)
::::Undid a part of your change. I do not understand the "longer" part: the input and output of the algorithm are two different data structures, comparing their lengths is definitely nontrivial. [[User:Викидим|Викидим]] ([[User talk:Викидим|talk]]) 17:58, 10 October 2024 (UTC)