irst, standard method will look at <b>a million values</b> in the worst case as it does a O(N) linear search across the container. At the same time, std::set::find() will perform <b>around 20</b> lookups in O(lg N) time, as it, knowing that it is an ordered tree structure (red-black) can perform a simple binary search. The standard algorithm must also support unsorted sequences and thus cannot do a binary search.</div>
<div><br/></div>
<div>Note also that for std::map and std::multimap, std::count would use