Algorithm - shuffle()

원형)

template <class RandomAccessIterator, class URNG>
  void shuffle (RandomAccessIterator first, RandomAccessIterator last, URNG&& g);

의미)

[Iterator first, Iterator last)사이에 있는 데이터들을 g를 랜덤 숫자 생성처럼 사용해서 랜덤하게 재정렬합니다.

소스)

#include<iostream>
#include<algorithm>
#include<vector>
#include<random>
#include<chrono>
 
void Print(const std::vector<int>& target)
{
    for (std::vector<int>::const_iterator iterPos = target.begin(); iterPos != target.cend(); iterPos++)
        std::cout << *iterPos << ' ';
    std::cout << std::endl;
}
 
void main()
{
    std::vector<int> vector = { 1,3,5,4,3,2,6,7,9,11 };
    std::vector<int> vectorCopy(10);
    std::cout << "Vector--->"; Print(vector);
    unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
    std::shuffle(vector.begin(), vector.end(), std::default_random_engine(seed));
    std::cout << "Vector--->"; Print(vector);
}

리턴값)

없음

결과)