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 vote163 views1 answer
Login system with c++
C++
0 vote144 views1 answer
C++ find with predicat
C++
2 votes143 views2 answers
Anagram
C++
3 votes160 views1 answer
C++ how to make a negative float positive
C++
0 vote147 views1 answer
C++ execution time
C++
0 vote168 views1 answer
Std::ifstream cant read file to large
C++
0 vote222 views1 answer
Primtiive calculator in c++
C++
0 vote146 views1 answer
Definition of singly linkedlist
C++
0 vote138 views2 answers
Subtract two numbers without using arithmetic operators in java
C++
0 vote168 views1 answer
Unreal engine overlap events c++ code
C++