//C program to Search element
//in Array using Binary Search
#include <stdio.h>

int binarySearch(int arr[],int l,int r,int x)
{
    if(r>=1){
        int mid=l+(r-l)/2;

        //If the element is present at the middle
        //itself
        if(arr[mid] == x)
            return mid;

        //If element is smaller than mid,then
        //it can only be present in left subarray
        if(arr[mid]>x)
            return binarySearch(arr,l,mid-1,x);

        //Else the element can only be present
        //in right subarray
        return binarySearch(arr,mid+1,r,x);
    }

    return -1;
        
}
int main() 
{
    int arr[]={11,14,19,23,40};
    int n=sizeof(arr)/sizeof(arr[0]);
    int x=40;
    //Function Call
    int result=binarySearch(arr,0,n-1,x);
    if(result == -1){
        printf("Element  is not present in array");
    }
    else{
        printf("Element is present at index %d",result);
    }
    return 0;
}