This program illustrates the lower_bound() member function for sets. The lower
bound of a value, in a sequence of values in ascending order, is the value at
the first location where the given value could be inserted without destroying
the order of the sequence. Equivalently, it is the first value in the sequence
that is >= the given value, if such a value exists; otherwise it is the end of
the sequence, or the conceptual but non-existent "one-past-the-last" value.
Press Enter to continue ...

Here are the values in our set: 2 4 6 8 10
The lower bound of 0 is 2.
The lower bound of 2 is 2.
The lower bound of 5 is 6.
The lower bound of 6 is 6.
The lower bound of 10 is 10.
The lower bound of 12 is at the end of the range.
Press Enter to continue ...