| Defined in header <experimental/algorithm>
|
||
| template< class RandomIt > void shuffle( RandomIt first, RandomIt last ); |
(library fundamentals TS v2) | |
Reorders the elements in the given range [first, last) such that each possible permutation of those elements has equal probability of appearance, using the per-thread random number engine as the random number generator.
Parameters
| first, last | - | the range of elements to shuffle randomly |
RandomIt must meet the requirements of ValueSwappable and LegacyRandomAccessIterator.
| ||
Return value
(none)
Complexity
Linear in the distance between first and last.
Example
#include <experimental/algorithm>
#include <iostream>
#include <string>
int main()
{
std::string sample{"ABCDEF"};
for (int i = 0; i != 4; ++i)
{
std::experimental::shuffle(sample.begin(), sample.end());
std::cout << sample << '\n';
}
}DACBFE
CDFBAE
BDCAFE
BAFCEDSee also
| (until C++17)(C++11) |
randomly re-orders elements in a range (function template) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.