The lower bound algorithm returns the first location in the sequence that value lower_bound Header <algorithm> template<class ForwardIterator, class T> inline ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value) The lower_bound algorithm returns the first location in the sequence that value can be inserted such that the order of the sequence is maintained. lower_bound returns an iterator positioned at the location that value can be inserted in the range [first..last), or returns last if no such position exists. lower_bound assumes the range [first..last) is sorted using operator<. template<class ForwardIterator, class T, class Compare> inline ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare compare) The lower_bound algorithm returns the first location in the sequence that value can be inserted such that the order of the sequence is maintained. lower_bound...
Learn C++ Programming fast and easy, find C++ Program Codes