Binary_search_reccursion.cpp

#include<iostream>
using namespace std;

bool binarySearch(int *arr,int s,int e,int k){


    //base case
    if(s>e)
        return false;

    int mid=s+(e-s)/2;
      //element found
      if(arr[mid]==k)
        return true;

    if(arr[mid]<k){
        return binarySearch(arr,mid+1,e,k);

    }
    else{
        return binarySearch(arr,s,mid-1,k);
    }

}


int main(){
    int arr[6]={2,4,6,10,16,18};
    int size=6;
    int key=18;

    cout<<"present or not :"<<binarySearch(arr,0,5,key)<<endl;
    return 0;

}