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

2 votes277 views1 answer
Eosio multi index clear
C++
5 votes281 views1 answer
What library to mention for swap function in c++
C++
0 vote277 views1 answer
Find subarray sum in c++
C++
0 vote281 views1 answer
Set width qpushbutton
C++
3 votes268 views1 answer
What language was c+ written in
C++
0 vote276 views1 answer
Cstring to string
C++
0 vote309 views1 answer
Stack overflow c++
C++
1 vote307 views1 answer
How to reverse a string in c++ using reverse function
C++
0 vote268 views1 answer
Strip whitespace c++
C++
11 votes247 views1 answer
Strcmp different length
C++