As given in the title, I'm interested in finding the complexity(upper-bound) of std::string::find method of c++ standard library which gives the position for a sub-string that is being matched. I couldn't find anything on cppreference page and was wondering if I need to manually role out KMP or some other pattern matching algo if complexity is not up to par.
In case standard does not guarantees any upper limit for such operation, I would like to know what common implementations are present in current versions of compilers and where to find them so that I could check them..
