Yes good point! I’ve worked your remark in the article. Thanks for pointing this out.

You say that map/set (etc)’s equal_range, lower_bound and upper_bound functions are equal in speed to the also equivalents but that isn’t the case. They may both use a logarithmic number of comparisons but the algo versions require up to a linear number of iterator increases to search, as map, set et al do not expose random access iterators. The member functions guarantee that the entire operation is in logarithmic time, including number of changes of position, by making use of the container’s internal structure.