(C++) std::partial_sort

std::partial_sort is an STL sorting algorithm to partially sort a container.


#include <algorithm>

#include <cassert>

#include <vector>



int main()

{

  std::vector<int> v;

  v.push_back(5);

  v.push_back(4);

  v.push_back(3);

  v.push_back(2);

  v.push_back(1);

  v.push_back(0);

  std::partial_sort(v.begin(),v.begin()+3,v.end());

  assert(v[0] == 0);

  assert(v[1] == 1);

  assert(v[2] == 2);

  assert(v[3] > 2);

  assert(v[4] > 2);

  assert(v[5] > 2);

}

Go back to Richel Bilderbeek's C++ page.

Go back to Richel Bilderbeek's homepage.