"binary_search in vector in c++" Code Answer's
You're definitely familiar with the best coding language C++ that developers use to develop their projects and they get all their queries like "binary_search in vector in c++" answered properly. Developers are finding an appropriate answer about binary_search in vector in c++ related to the C++ coding language. By visiting this online portal developers get answers concerning C++ codes question like binary_search in vector in c++. Enter your desired code related query in the search bar and get every piece of information about C++ code related question on binary_search in vector in c++.
binary_search in vector in c++
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//defining the comparator function returns true or false
//not for binary search..
bool f(int x, int y){
return x>y; //for decreasing order
}
int main() {
vector<int> A ={ 11,2,3,14 };
cout<<A[1]<<endl;//2
sort(A.begin(), A.end()); // sort in order to perform binary search
cout<<A[1]<<endl;//3 after sorting
bool present = binary_search(A.begin(), A.end(), 3);
cout<<present<<endl;//will return true
present = binary_search(A.begin(), A.end(), 5);
cout<<present<<endl;//will return false
A.push_back(100);//inserting new element from end
present = binary_search(A.begin(), A.end(), 100);
cout<<present<<endl;
A.push_back(100);
A.push_back(100);
A.push_back(100);
A.push_back(121);
//give me the iterator pointing to first element >= 100
vector<int>::iterator it = lower_bound(A.begin(), A.end(), 100);
//you can also use auto as c++ will see that a lower_bound is performed
//and it will figur it out that it is an iterator of vector<int>
//auto it = lower_bound(A.begin(), A.end(), 100);
//auto it2 = upper_bound(A.begin(), A.end(), 100);
//give me an iterator pointing to first element >100
vector<int>::iterator it2 = upper_bound(A.begin(), A.end(), 100);
//print the content of it and it2
cout<<*it<<" "<<*it2<<endl;
//give me the number of hundreds(100)
cout<<it2-it<<endl; //4 it subtracts the indices
//soritng the vector in reverse order
//use method overloading with sort by passing a comparator function
//to control the ordering
sort(A.begin(), A.end(), f);
//now print the sorted vector using iterator
vector<int>::iterator it3;
for (it3 =A.begin(); it3!= A.end(); it3++){
cout<<*it3<<" ";
}
cout<<endl;
//A shorter code for the above will be
for(int x: A){
//x++ wont change the vector content it will only print the changed one
cout<<x<<" ";
}
cout<<endl;
//to change the vector content while iterating
//iterate it by referance by using &x
for(int &x: A){
x++;
cout<<x<<" ";
}
cout<<endl;
return 0;
}
All those coders who are working on the C++ based application and are stuck on binary_search in vector in c++ can get a collection of related answers to their query. Programmers need to enter their query on binary_search in vector in c++ related to C++ code and they'll get their ambiguities clear immediately. On our webpage, there are tutorials about binary_search in vector in c++ for the programmers working on C++ code while coding their module. Coders are also allowed to rectify already present answers of binary_search in vector in c++ while working on the C++ language code. Developers can add up suggestions if they deem fit any other answer relating to "binary_search in vector in c++". Visit this developer's friendly online web community, CodeProZone, and get your queries like binary_search in vector in c++ resolved professionally and stay updated to the latest C++ updates.