1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
|
#include <iterator>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
vector<int> uv = { 1, -2, 3, -4, 5, -6, 7, -8, 9};
auto iter = is_sorted_until(uv.begin(), uv.end());
if (iter == uv.begin() + 1)
cout << "no initially sorted subrange\n";
sort(uv.begin(), uv.end());
uv[5] = uv[0]; // force a sorted subrange
cout << "sorted subrange: ";
copy(uv.begin(), is_sorted_until(uv.begin(), uv.end()),
ostream_iterator<int>{ cout, " " });
cout << '\n';
}
// Displays:
// sorted before: 0
// sorted after 1
|
