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 vote115 views1 answer
C++ vector fill
C++
-1 vote69 views1 answer
Standard input c++
C++
0 vote110 views1 answer
Cpp set time
C++
0 vote108 views1 answer
How to know the number of a certain substring in a string in c++
C++
1 vote105 views1 answer
Qt design editor hide window bottom white bar
C++
2 votes107 views1 answer
Hwo to calculate the number of digits using log in c++
C++
1 vote92 views1 answer
Il2cpp unity stuck c#
C++
0 vote108 views1 answer
Error c4001 site:docs.microsoft.com
C++
42 votes115 views10 answers
Twitter
C++
0 vote119 views1 answer
Dream speedrun music free download mp3
C++