Recursive Binary Search

 HERE IS THE CODE

#include<bits/stdc++.h>
using namespace std;
int arr[1000], n, element;
int binary_search(int l, int r) {
    int mid = (l + r)/2;
    if (l>r) {
        return -1;
    }
    if (arr[mid] == element) {
        return mid;
    } else if (element < arr[mid]) {
    return binary_search(l, mid);
    } else {
    return binary_search(mid, r);
    }
}

int main() {
    cin>>n;
    for (int i=0;i<n;i++) {
        cin>>arr[i];
    }
    cin>>element;
    cout<<binary_search(0, n-1);
    return 0;
}