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 vote367 views1 answer
Tabeau pseudo dynamique sur c++
C++
0 vote370 views1 answer
C++ set comparator
C++
22 votes325 views3 answers
Get line C++
C++
0 vote364 views1 answer
Hide window c++
C++
267 votes440 views1 answer
Visual studio c++ compiler
C++
1 vote363 views1 answer
C++ split long code
C++
0 vote409 views1 answer
Deletion in bst
C++
1 vote369 views1 answer
C++ until
C++
1 vote326 views1 answer
C++ vs c#
C++
0 vote313 views2 answers
String to wstring conversion c++
C++