Binary search Basic.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define set_bits __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<x<<" ";
//binary search simple
int solve(vector<int>&v,int target)
{
    int l=0,h=v.size()-1;
    while(l<=h)
    {
        int mid=l+(h-l)/2;
        if(v[mid]==target)
        {
            return mid;
        }
        else if(v[mid]<target)
        {
            l=mid+1;
        }
        else
        {
            h=mid-1;
        }
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    clock_t time_req=clock();
//input of the vector
    int n;
    cin>>n;
    vector<int>v;
    while(n--)
    {
        int temp;
        cin>>temp;
        v.push_back(temp);
    }

    int target;
    cin>>target;
    int ans=solve(v,target);
    cout<<ans;





#ifndef ONLINE_JUDGE
    cout<<endl<<"Time: "<<fixed<<setprecision(6)<<((double)(clock()-time_req))/CLOCKS_PER_SEC<<endl;
#endif
}