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 vote138 views1 answer
Auto keyword
C++
7 votes138 views3 answers
Length of 2d array c++
C++
23 votes137 views6 answers
String to char
C++
14 votes134 views6 answers
How to get size of array c++
C++
2 votes151 views1 answer
Ue4 cpp OnHit
C++
0 vote129 views1 answer
How to play sounds in c++
C++
2 votes146 views1 answer
Variable vs pointer in c++
C++
26 votes154 views2 answers
Remove from vector by value c++
C++
5 votes132 views1 answer
C++ vector iterator
C++
7 votes140 views2 answers
Min heap stl
C++