binarySearch.cpp

#include <bits/stdc++.h> 
using namespace std; 
  

int binarySearch(int arr[], int l, int r, int x) 
{ 
    if (r >= l) { 
        int mid = l + (r - l) / 2; 
  
       
        if (arr[mid] == x) 
            return mid; 
  
        if (arr[mid] > x) 
            return binarySearch(arr, l, mid - 1, x); 
  
        
        return binarySearch(arr, mid + 1, r, x); 
    } 
  
   
    return -1; 
} 
  
int main(void) 
{
    int n;
    cin>>n;
    int arr[n];
  for(int i=0;i<n;i++)
  {
   cin>>arr[i];
  }
     
   int k;
   cout<<"Enter the search element:";
   cin>>k;
    
    int result = binarySearch(arr, 0, n - 1, k); 
    (result == -1) ? cout << "Element is not present in array"
                   : cout << "Element is present at index " << result; 
    return 0; 
}