Aho-Corasick ●Pro O searching time complexity is o(n)(independent from the pattern set size) ●Cons OWhen patern set size increase, the memory needed increase drastically O Cache and memory access time changing will compromise the time performanceAho-Corasick ⚫Pro: searching time complexity is O(n) (independent from the pattern set size) ⚫Cons: When pattern set size increase, the memory needed increase drastically. Cache and memory access time changing will compromise the time performance