Recursive and Iterative Binary Search

#include<iostream>
using namespace std;

//Recursive Binary Function
int recbinarysearch(int a[],int f,int l,int n)
{
    int mid=(f+l)/2;
    if(f>l)
    {
        return -1;
    }
    if(a[mid]==n)
    {
        return mid;
    }
    else if(a[mid]>n)
    {
        return recbinarysearch(a,f,mid-1,n);
    }
    else
    {
        return recbinarysearch(a,mid+1,l,n);
    }
}

//Iterative Binary Search
int itebinarysearch(int a[],int f,int l,int no)
{
    int mid;
    while(f<=l)
    {
        mid=(f+l)/2;
        if(a[mid]==no)
        {
            return mid;
        }
        else if(a[mid]>no)
        {
            l=mid-1;
        }
        else
        {
            f=mid+1;
        }
    }
    return -1;
}

int main()
{
    int ch;
    while(1)
    {
        cout<<"For Recursive Binary Search: 1 ,Iterative Binary Search: 2, Exit: 3"<<endl;
        cout<<"Enter your choice: ";
        cin>>ch;
        
        switch(ch)
        {
            case 1:
            {
                int n;
                cout<<"Enter the number of elements in the array: ";
                cin>>n;
                int a[n];
                for(int i=0;i<n;i++)
                {
                    cout<<"Enter the element "<<i+1<<": ";
                    cin>>a[i];
                }
                int no,r;
                cout<<"Enter the element to be searched: ";
                cin>>no;
                r=recbinarysearch(a,0,n-1,no);
                if(r==-1)
                {
                    cout<<"Element not found"<<endl;
                }
                else
                {
                    cout<<"Element found at position "<<r+1<<endl;
                }
                break;
            }
            case 2:
            {
                int n;
                cout<<"Enter the number of elements in the array: ";
                cin>>n;
                int a[n];
                for(int i=0;i<n;i++)
                {
                    cout<<"Enter the element "<<i+1<<": ";
                    cin>>a[i];
                }
                int no,r;
                cout<<"Enter the element to be searched: ";
                cin>>no;
                r=itebinarysearch(a,0,n-1,no);
                if(r==-1)
                {
                    cout<<"Element not found"<<endl;
                }
                else
                {
                    cout<<"Element found at position "<<r+1<<endl;
                }
                break;
            }
            case 3:
            {
                exit(0);
                break;
            }
            default:
            {
                cout<<"Enter the correct choice."<<endl;
                break;
            }
        }
    }
}