#include<algorithm>
#include<iostream>
#include<vector>
#include<iterator>
using namespace std;
int main()
{vector<int>v;vector<int>::iterator itr;pair< vector<int>::iterator, vector<int>::iterator >vecpair;for(int i = 1; i <= 20; i++){v.push_back(i%6);}sort(v.begin(),v.end());cout << "array: " << endl << "    ";copy(v.begin(),v.end(),ostream_iterator<int>(cout," "));cout << endl;//lower_boundcout << "lower_bound function, value = 3:" << endl; itr = lower_bound(v.begin(),v.end(),3);cout << "    [first, itr) = ";copy(v.begin(),itr,ostream_iterator<int>(cout," "));cout << endl;cout << "    [itr, last) = ";copy(itr,v.end(),ostream_iterator<int>(cout," "));cout << endl << endl;// upper_boundcout << "upper_bound function, value = 3:" << endl; itr = upper_bound(v.begin(),v.end(),3);cout << "    [first, itr) = ";copy(v.begin(),itr,ostream_iterator<int>(cout," "));cout << endl;cout << "    [itr, last) = ";copy(itr,v.end(),ostream_iterator<int>(cout," "));cout << endl << endl;// equal_rangecout << "equal_range function, value = 3:" << endl; vecpair = equal_range(v.begin(),v.end(),3);cout << "    [vecpair->first, vecpair->second) = ";copy(vecpair.first, vecpair.second, ostream_iterator<int>(cout," "));cout << endl << endl;//binary_search, value = 3cout << "binary_search function, value = 3:" << endl;cout << "3 is " << (binary_search(v.begin(),v.end(),3) ? "":"not ") << "in array." << endl;cout << endl;//binary_search, value = 6cout << "binary_search function, value = 6:" << endl;cout << "6 is " << (binary_search(v.begin(),v.end(),6) ? "":"not ") << "in array." << endl;cout << endl;return 0;
}

array:0 0 0 1 1 1 1 2 2 2 2 3 3 3 4 4 4 5 5 5
lower_bound function, value = 3:[first, itr) = 0 0 0 1 1 1 1 2 2 2 2[itr, last) = 3 3 3 4 4 4 5 5 5upper_bound function, value = 3:[first, itr) = 0 0 0 1 1 1 1 2 2 2 2 3 3 3[itr, last) = 4 4 4 5 5 5equal_range function, value = 3:[vecpair->first, vecpair->second) = 3 3 3binary_search function, value = 3:
3 is in array.binary_search function, value = 6:
6 is not in array.