C++ Educational Content Creator | 20 years of Software Engineering experience distilled into digestible daily posts
The std::find_first_of algorithm returns the left-most element from the first range that matches any of the elements in a second range. Since neither range is ordered, the complexity is quadratic. Compiler Explorer link: https://lnkd.in/enq8tU7a #cpp #cplusplus #coding #programming #dailybiteofcpp
That's interesting, I've kinda always felt reassured that the Standard Library didn't offer anything worse than O(n log n).