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

1 vote127 views2 answers
Cpp compare strings
C++
0 vote129 views1 answer
GlUniform bool
C++
0 vote124 views1 answer
#pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops")
C++
11 votes174 views3 answers
Get ascii value of string in C++
C++
6 votes143 views3 answers
C++ correct upto 3 decimal places
C++
0 vote139 views1 answer
Unordered_set to vector
C++
0 vote138 views1 answer
Are maps sorted c++
C++
0 vote135 views1 answer
How to get max grade c++
C++
0 vote119 views1 answer
Attack on titan junior high list of episodes
C++
0 vote123 views1 answer
C++ sort cout end
C++