Binary_Search (Easy).cpp

Binary_Search (Easy).cpp

 /*     Nasim        */
 
 #include<iostream>
#define re(n) for(int i=0;i<n;i++)
using namespace std;

int Bs(int arr[],int l,int r,int x)
{
    int mid;

    while(l<=r)
    {
        mid = l+(r-l)/2;

        if (arr[mid] == x)
            return mid;
        else if (arr[mid] > x)
            r = mid-1;
        else
            l = mid+1;
    }
    return -1;
}

int main()
{
    int n;
    cin>>n;
    int arr[n];

    re(n)
        cin>>arr[i];
    cout<<"Have to Find : ";

    int x;
    cin>>x;

    int res = Bs(arr,0,n-1,x);

    if(res == -1)
        cout<<"Not Found\n";
    else
        cout<<"Found at position "<<res<<"  <0-base indexing>\n";
    return 0;

}