partial_sort()

#include <algorithm>

void partial_sort (Ran first, Ran middle, Ran last) 
void partial_sort (Ran first, Ran middle, Ran last, Binary comp) 
void partial_sort (Exec pol, Ran first, Ran middle, Ran last) 
void partial_sort (Exec pol, Ran first, Ran middle, Ran last, Binary comp) 
 
Ran ranges::partial_sort (Range r, Ran middle, Binary comp = {}, Proj proj = {}) 
Ran ranges::partial_sort (Ran first, Ran middle, Ran last, Binary comp = {}, Proj proj = {}) 

Bringt die kleinsten Elemente des Bereiches [first,last) aufsteigend geordnet im Bereich [first,middle) unter.

Rückgabewert: keiner bzw. last.

is_sorted(), is_sorted_until(), partition(), partial_sort_copy(), sort().

partial_sort.cpp

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <string>
 
int main()
{
  std::string s = "ein Beispiel";
  std::cout << s << '\n';
 
  std::partial_sort(begin(s), begin(s)+5, end(s));
 
  std::cout << s << '\n'
            << "     ^ davor sortiert\n";
}