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 vote200 views1 answer
Replace a substring with another string in c++
C++
1 vote249 views1 answer
Xmake run with arg
C++
0 vote275 views2 answers
Decrement c++
C++
0 vote256 views3 answers
C++ variable type
C++
2 votes239 views1 answer
Binary search return index c++
C++
1 vote271 views1 answer
True/false: the ampersand ( &) is used to dereference a pointer variable in c++.
C++
0 vote240 views1 answer
Kadane algorithm with negative numbers included as sum
C++
-2 votes283 views1 answer
How to iterate through array in c++
C++
8 votes238 views3 answers
Print to console c++
C++
0 vote255 views6 answers
Python converter to c
C++