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 vote271 views1 answer
Passing custom function in sort cpp
C++
0 vote343 views4 answers
C++ template
C++
0 vote295 views1 answer
How to declare a 2D vector in c++ of size m*n with value 0
C++
1 vote300 views1 answer
Get current date in c++
C++
1 vote276 views1 answer
C++ remove n characters from string
C++
0 vote290 views1 answer
C++ define array with values
C++
0 vote359 views1 answer
Youtube Video Downloder Website
C++
0 vote273 views1 answer
Zero fill in c++
C++
0 vote310 views1 answer
C++ multiply char
C++
0 vote301 views1 answer
First and last digit of a number in c++
C++