Algorithm - partial_sort()

원형)

//기본형
template <class RandomAccessIterator>
  void partial_sort (RandomAccessIterator first, RandomAccessIterator middle,
                     RandomAccessIterator last);
 
//사용자 정의형
template <class RandomAccessIterator, class Compare>
  void partial_sort (RandomAccessIterator first, RandomAccessIterator middle,
                     RandomAccessIterator last, Compare comp);

의미)

Iterator first 와 Iterator middle까지의 데이터를 정렬합니다.  

소스)

#include <iostream>
#include <algorithm>
#include <vector>
 
void print(std::vector<int> Target_Vector)
{
    for (std::vector<int>::iterator IterPos = Target_Vector.begin(); IterPos != Target_Vector.end(); ++IterPos)
        std::cout << *IterPos << " ";
    std::cout << std::endl;
}
void main() 
{
    std::vector<int> Vector = { 25, 5,15,10,20,30,15 };
    print(Vector);
    std::partial_sort(Vector.begin(), Vector.begin() + 3, Vector.end());
    print(Vector);
}
 

리턴값)

없음

결과)