I come to you seeking help for yet another high school c++ program, don't shoot me .
I need to map the number of appearances of multiple patterns in a string. I studied the KMP and Boyer–Moore algorithms so far - but searching for each particular pattern once at a time is not fast enough. Google searching revealed Aho-Corasick as being a possible solution, but I can't seem to find proper documentation for it.
If anyone can link a tutorial of implementing Aho-Corasick or another solution for efficiently searching for multiple patterns in a given string I will be most grateful.