prev_permutation

partition

template <class BiIter, class UnPred>    BiIter partition(BiIter start, BiIter end, UnPred pfn);

The partition( ) algorithm arranges the sequence defined by start and end such that all elements for which the predicate specified by pfn returns true come before those for which the predicate returns false. It returns an iterator to the beginning of the elements for which the predicate is false.