C++ std::lower_bound with std::vector
DESCRIPTION:
This C++ article is about the lower_bound() algorithm function. It is an STL algorithm in <algorithm> header file. It returns an iterator pointing to the first element in the range [first,last) which does not compare less than val.
lower_bound() has two definition:
1)
template <class ForwardIterator, class T> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);
2)
template <class ForwardIterator, class T, class Compare> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);
The elements are compared using operator< for the first version, and comp for the second. The elements in the range shall already be sorted according to this same criterion (operator< or comp), or at least partitioned with respect to val.
The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted range, which is specially efficient for random-access iterators.Unlike upper_bound, the value pointed by the iterator returned by this function may also be equivalent to val, and not only greater.
Input:-
first, last
val
This can either be a function pointer or a function objec
This article deals with the first definition.
The behavior of this function template is equivalent to:
template <class ForwardIterator, class T> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val) { ForwardIterator it; iterator_traits<ForwardIterator>::difference_type count, step; count = distance(first,last); while (count>0) { it = first; step=count/2; advance (it,step); if (*it<val) { // or: if (comp(*it,val)), for version (2) first=++it; count-=step+1; } else count=step; } return first; }
IMPLEMENTATION:
using namespace std; int main () { int myints[] = {1,2,3,3,2,1,1,2}; vector<int> v(myints,myints+8); sort (v.begin(), v.end()); vector<int>::iterator low; low=lower_bound (v.begin(), v.end(), 2); cout << "lower_bound at position " << (low- v.begin()) << '\n'; return 0; }
OUTPUT:
lower_bound at position 3
This C++ article is about the lower_bound() algorithm function. It is an STL algorithm in <algorithm> header file. It returns an iterator pointing to the first element in the range [first,last) which does not compare less than val.
lower_bound() has two definition:
1)
template <class ForwardIterator, class T> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);
2)
template <class ForwardIterator, class T, class Compare> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);
The elements are compared using operator< for the first version, and comp for the second. The elements in the range shall already be sorted according to this same criterion (operator< or comp), or at least partitioned with respect to val.
The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted range, which is specially efficient for random-access iterators.Unlike upper_bound, the value pointed by the iterator returned by this function may also be equivalent to val, and not only greater.
Input:-
first, last
Forward iterators to the initial and final positions of a sorted (or properly partitioned) sequence. The range used
is [first,last), which contains all the elements between first and last, including the element pointed by first but not
the element pointed by last.
Value of the lower bound to search for in the range. For (1), T shall be a type supporting being compared
with elements of the range [first,last) as the right-hand side operand of operator <.
comp
Binary function that accepts two arguments (the first of the type pointed by ForwardIterator, and the second,
always val), and returns a value convertible to bool. The value returned indicates whether the first argument
is considered to go before the second.
The function shall not modify any of its arguments.This can either be a function pointer or a function objec
This article deals with the first definition.
The behavior of this function template is equivalent to:
template <class ForwardIterator, class T> ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val) { ForwardIterator it; iterator_traits<ForwardIterator>::difference_type count, step; count = distance(first,last); while (count>0) { it = first; step=count/2; advance (it,step); if (*it<val) { // or: if (comp(*it,val)), for version (2) first=++it; count-=step+1; } else count=step; } return first; }
IMPLEMENTATION:
using namespace std; int main () { int myints[] = {1,2,3,3,2,1,1,2}; vector<int> v(myints,myints+8); sort (v.begin(), v.end()); vector<int>::iterator low; low=lower_bound (v.begin(), v.end(), 2); cout << "lower_bound at position " << (low- v.begin()) << '\n'; return 0; }
OUTPUT:
lower_bound at position 3
Comments