Algorithm - reverse()

워형)

template <class BidirectionalIterator>
  void reverse (BidirectionalIterator first, BidirectionalIterator last);

의미)

[Iterator first, Iterator last) 사이에있는 원소들의 순서를 반전합니다.

소스)

#include<iostream>
#include<algorithm>
#include<vector>
 
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::cout << "Vector--->"; Print(vector);
    std::reverse(vector.begin(), vector.end());
    std::cout << "Vector--->"; Print(vector);
}

리턴값)

없음

결과)