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 vote226 views1 answer
Pretty Print c++ chegg
C++
1 vote220 views1 answer
Preorder
C++
0 vote226 views1 answer
Output to console in color c++
C++
1 vote216 views1 answer
Qt qmessagebox
C++
5 votes212 views2 answers
Conditional operator in cpp
C++
0 vote202 views1 answer
Powers of 2 in cpp
C++
1 vote214 views1 answer
Ue4 find component c++
C++
0 vote228 views1 answer
C++ program to find gcd of 3 numbers
C++
1 vote205 views1 answer
64 bit unsigned integer c++
C++
0 vote210 views1 answer
C++ set value to inf
C++