Поделиться через

prev_permutation (STL/CLR)

  • Статья

Reorders the elements in a range so that the original ordering is replaced by the lexicographically next greater permutation if it exists, where the sense of next may be specified with a binary predicate.

template<class _BidIt> inline
    bool prev_permutation(_BidIt _First, _BidIt _Last);
template<class _BidIt, class _Pr> inline
    bool prev_permutation(_BidIt _First, _BidIt _Last, _Pr _Pred);

Remarks

This function behaves the same as the STL function prev_permutation. For more information, see prev_permutation.

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Reference

algorithm (STL/CLR)