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

5 votes112 views3 answers
Int to float c++
C++
1 vote96 views1 answer
Std::stack
C++
0 vote100 views4 answers
How to modify 2d array in function c++
C++
8 votes109 views5 answers
Sum of vector c++
C++
0 vote103 views1 answer
Convert char to C
C++
2 votes55 views1 answer
Java print f int
C++
0 vote111 views1 answer
What is blob in computer vision
C++
0 vote114 views2 answers
Avl tree c++
C++
0 vote90 views1 answer
C++ read_ascii
C++
0 vote97 views1 answer
Sento freddo a un dente
C++