This program illustrates the use of the STL lower_bound() algorithm (default
version) to find the lower bound location of a given target value in a vector
of integers sorted in ascending order.
Press Enter to continue ...

Here are the contents of v:
2 3 5 6 7 7 7 8 9 10
Press Enter to continue ...

Lower bound of 3 in v = 3
Press Enter to continue ...

Lower bound of 4 in v = 5
Press Enter to continue ...

Lower bound of 5 in v = 5
Press Enter to continue ...

Lower bound of 7 in v = 7
This is the first of the three 7's, since the value before this 7 is 6.
Press Enter to continue ...

Lower bound of 0 in v = 2
Press Enter to continue ...

Note that the lower bound location of 15 is
the end (one-past-the-last) vector position.
Press Enter to continue ...