Algoritmi za pretragu - Binary search

#include <iostream>
using namespace std;

int BinarySearch(int A[], int l, int r, int x)
{
    if (l>r) return -1;

    int mid=l+(r-l)/2;

    if (A[mid]==x) return mid;
    if (A[mid]>x) return BinarySearch(A,l,mid-1,x);
    return BinarySearch(A,mid+1,r,x);
}

int main()
{
    int n,x;
    cin>>n;

    int A[n];

    for (int i=0;i<n;i++)
        cin>>A[i];

    cin>>x;

    int res=BinarySearch(A,0,n-1,x);

    if (res==-1) cout<<"U nizu nema trazenog broja"<<endl;
    else cout<<"Broj se nalazi na poziciji "<<res<<endl;

    return 0;
}