28 Algorithms library [algorithms]

28.7 Sorting and related operations [alg.sorting]

28.7.11 Permutation generators [alg.permutation.generators]

🔗
template<class BidirectionalIterator> bool next_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare> bool next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1
#
Requires: BidirectionalIterator shall satisfy the requirements of ValueSwappable ([swappable.requirements]).
2
#
Effects: Takes a sequence defined by the range [first, last) and transforms it into the next permutation.
The next permutation is found by assuming that the set of all permutations is lexicographically sorted with respect to operator< or comp.
3
#
Returns: true if such a permutation exists.
Otherwise, it transforms the sequence into the smallest permutation, that is, the ascendingly sorted one, and returns false.
4
#
Complexity: At most (last - first) / 2 swaps.
🔗
template<class BidirectionalIterator> bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare> bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
5
#
Requires: BidirectionalIterator shall satisfy the requirements of ValueSwappable ([swappable.requirements]).
6
#
Effects: Takes a sequence defined by the range [first, last) and transforms it into the previous permutation.
The previous permutation is found by assuming that the set of all permutations is lexicographically sorted with respect to operator< or comp.
7
#
Returns: true if such a permutation exists.
Otherwise, it transforms the sequence into the largest permutation, that is, the descendingly sorted one, and returns false.
8
#
Complexity: At most (last - first) / 2 swaps.