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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
#include <algorithm>
#include <iostream>
#include <iterator>
#include <functional>
using namespace std;
int main()
{
int ia[] = {10, 20, 30};
cout << "Sequence: ";
copy(ia, ia + 3, ostream_iterator<int>(cout, " "));
cout << '\n';
cout << "15 can be inserted before " <<
*lower_bound(ia, ia + 3, 15) << '\n';
cout << "35 can be inserted after " <<
(lower_bound(ia, ia + 3, 35) == ia + 3 ?
"the last element" : "???") << '\n';
iter_swap(ia, ia + 2);
cout << "Sequence: ";
copy(ia, ia + 3, ostream_iterator<int>(cout, " "));
cout << '\n';
cout << "15 can be inserted before " <<
*lower_bound(ia, ia + 3, 15, greater<int>()) << '\n';
cout << "35 can be inserted before " <<
(lower_bound(ia, ia + 3, 35, greater<int>()) == ia ?
"the first element " : "???") << '\n';
}
/*
Displays:
Sequence: 10 20 30
15 can be inserted before 20
35 can be inserted after the last element
Sequence: 30 20 10
15 can be inserted before 10
35 can be inserted before the first element
*/
|
