lower_bound()firstlastvalvallast

number4,10,11,30,69,70,96,100.3,9,111.pos

pos = lower_bound( number, number + 8, 3) – numberpos = 0.number0
pos = lower_bound( number, number + 8, 9) – number pos = 1number110
pos = lower_bound( number, number + 8, 111) – number pos = 8number87
lower_bound()firstlastvalvallastlast~
>=

?Download sourceCode.cpp
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
42
43
44
45
46
47
48
49
50
51

#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
 
using namespace std;
 
 
int main()
{
    const int VECTOR_SIZE = 8 ;
 
    // Define a template class vector of int
    typedef vector<int > IntVector ;
 
    //Define an iterator for template class vector of strings
    typedef IntVector::iterator IntVectorIt ;
 
    IntVector Numbers(VECTOR_SIZE) ;
 
    IntVectorIt start, end, it, location ;
 
    // Initialize vector Numbers
    Numbers[0] = 4 ;
    Numbers[1] = 10;
    Numbers[2] = 11 ;
    Numbers[3] = 30 ;
    Numbers[4] = 69 ;
    Numbers[5] = 70 ;
    Numbers[6] = 96 ;
    Numbers[7] = 100;
 
    start = Numbers.begin() ;   // location of first
                                // element of Numbers
 
    end = Numbers.end() ;       // one past the location
                                // last element of Numbers
 
    // print content of Numbers
    cout << "Numbers { " ;
    for(it = start; it != end; it++)
        cout << *it << " " ;
    cout << " }\n" << endl ;
 
    // return the first location at which 10 can be inserted
    // in Numbers
    location = lower_bound(start, end, 1) ;
 
    cout << "First location element 10 can be inserted in Numbers is: "
        << location - start<< endl ;
}