C++17 STL Cookbook

How it works...

We have used different algorithms, which have to do with sorting:

Algorithm	Purpose
std::sort	Accepts a range as arguments and simply sorts it.
std::is_sorted	Accepts a range as argument and tells if that range is sorted.
std::shuffle	This is, kind of, the reverse operation to sorting; it accepts a range as arguments and shuffles its items around.
std::partial_sort	Accepts a range as arguments and another iterator, which tells until where the input range should be sorted. Behind that iterator, the rest of the items appear unsorted.
std::partition	Accepts a range and a predicate function. All items for which the predicate function returns true are moved to the front of the range. The rest is moved to the back. ...