Merits of std::find
Is there any advantage to using C++11's std::find over a container's find method? In the case of std::vector (which does not have a find method) does std::find use some smart algorithm or the naive way of simply iterating over every element? In the case of std::map it seems you need to pass along an std::pair , which is the value_type of an std::map . This does not seem very useful as usually you'd want to find for either a key or a mapped element. What about other containers like std::list or std::set or std::unordered_set ? In the case of std::vector (which does not have a find method) does