Modern C++ Programming Cookbook

How it works...

All the preceding general algorithms take random iterators as arguments to define the range to be sorted and, some of them additionally take an output range. They all have overloads, one that requires a comparison function for sorting the elements, and one that does not and uses operator< for comparing the elements.

These algorithms work in the following way:

• std::sort() modifies the input range so that its elements are sorted according to the default or the specified comparison function; the actual algorithm for sorting is an implementation detail.
• std::stable_sort() is similar to std::sort(), but it guarantees to preserve the original order of elements that are equal.
• std::partial_sort() takes three iterator arguments indicating ...