std::random_shuffle

From Cppreference

Reorders the elements in the given range [first, last) in random order. One version of the function uses internal implementation-defined random number generator, another uses the given random number generator r.

Parameters

Return value

(none)

Complexity

linear in the distance between first and last

Equivalent function

​template< class RandomAccessIterator, RandomNumberGenerator r >
void random_shuffle( RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& r )
{
    std::iterator_traits<RandomAccessIterator>::difference_type i, n;
    n = last - first;
    for (i = n-1; i > 0; --i) {
        std::swap(first[i], first[r(i)]);
    }
}​

Example

See also