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

19 votes110 views2 answers
C++ rewrite file
C++
0 vote145 views1 answer
C++ uint32_t
C++
0 vote116 views1 answer
C++ windows error message
C++
4 votes110 views3 answers
Count set bits in an integer c++
C++
0 vote127 views1 answer
C++ cin accept only numbers
C++
29 votes193 views6 answers
How to convert string to int in c++
C++
92 votes237 views6 answers
String reverse
C++
0 vote115 views1 answer
Xor in c++
C++
0 vote101 views1 answer
SFML texture from file max size
C++
0 vote114 views1 answer
The smallest element from three
C++