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 vote141 views7 answers
Hexo
C++
6 votes161 views2 answers
Min heap priority queue c++
C++
0 vote143 views1 answer
Cpp pushfront vector
C++
0 vote151 views1 answer
C++ little endian or big endian
C++
0 vote150 views1 answer
Google pdf iframe viwer
C++
0 vote150 views1 answer
How to take full sentence in c++
C++
0 vote180 views1 answer
For loop in c++ hackerrank solution
C++
1 vote169 views1 answer
Flags for g++ compiler
C++
0 vote155 views1 answer
C++ drop last element of list
C++
0 vote138 views2 answers
See Compilation Time in c++ Program
C++