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

1 vote177 views1 answer
C++ overwrite file
C++
0 vote154 views1 answer
Std::map get all keys
C++
0 vote157 views1 answer
Person parametr cpp
C++
4 votes164 views1 answer
Shuffle vector c++
C++
2 votes187 views1 answer
Upper_bound
C++
0 vote112 views1 answer
How to print hex of char c++
C++
1 vote153 views1 answer
Priority queue c++ type of pairs
C++
0 vote223 views1 answer
Curl upload folder and subfolders
C++
-1 vote210 views1 answer
C++ how to return an empty vector
C++
9 votes168 views3 answers
C++ throw exception
C++