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 vote282 views1 answer
How to make dictionary of numbers in c++
C++
5 votes264 views10 answers
Array
C++
0 vote276 views1 answer
Creating node in c++
C++
0 vote254 views1 answer
PI IN C++ WITH CMATH
C++
3 votes257 views1 answer
C++ generate random char
C++
0 vote263 views1 answer
Print all substrings in c++
C++
2 votes254 views1 answer
Suppress individual warnings in visual c++
C++
0 vote255 views1 answer
Arduino C++ servomotor random moving
C++
1 vote284 views1 answer
C++ 2d vector assign value
C++
0 vote256 views1 answer
Abstraction in cpp
C++