Talk:Aho–Corasick algorithm: Difference between revisions

Content deleted Content added
Line 68:
 
:The statement is meant to be "quadratic in length of input", where length of input is total number of characters. But that claim is wrong, it cannot be quadratic - it is a nice exercise to show that there's an instance with <math>\Theta(n \sqrt(n))</math> matches, and that it cannot be asymptotically more. [[User:Al-Quaknaa|Martin Koutecký]] ([[User talk:Al-Quaknaa|talk]]) 19:27, 9 October 2024 (UTC)
::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)