Vector search by element

#include <vector> // vector 
#include <algorithm> // find 
#include <iostream> // cout 
using namespace std;
int main()
{
    vector<int> nums = {1,2,3,4,5,6,7,8,9};
    bool isSorted = is_sorted(nums.begin(), nums.end());
    if(isSorted){
        cout << "Using binary search: " << endl;
        if(binary_search(nums.begin(), nums.end(), 9))
            cout << "found it" << endl;
        else
            cout << "not here" << endl;
    }
    else{
        cout << "Using std::find";
        if(std::find(nums.begin(), nums.end(), 9) != nums.end())
            cout << "found it" << endl;
        else
            cout << "not here" << endl;
    }
}

Source: stackoverflow.com

Similar codes

0 vote174 views1 answer
Compile c++ MPI Program
C++
0 vote160 views1 answer
Smooth Poti values on Arduino
C++
0 vote198 views1 answer
Lru cache gfg
C++
1 vote164 views1 answer
Qlabel set text color
C++
0 vote185 views1 answer
Sort html elements in Jquery on condition
C++
0 vote192 views1 answer
Heroatx77
C++
-5 votes174 views1 answer
Convert char or string to int or double
C++
0 vote177 views1 answer
Print queue c++
C++
8 votes177 views2 answers
C++ factorial
C++
0 vote174 views1 answer
Greater <pair<int,int>>
C++