Binary Search program in C using Recursion|Studyinight Programmer

 #include<stdio.h>
int binarysearch(int *,int ,int ,int x );
int main()
{
    int n,i,a[90],x;
    printf("Enter total number elements\n");
    scanf("%d",&n);
    printf("Enter total %d elements\n",n);
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
         for(i=0;i<n;i++)
        printf("%d\t",a[i]);
        printf("\nEnter elements you want to search\n");
        scanf("%d",&x);
        binarysearch(a,0,n-1,x);

}
int binarysearch(int *a,int p ,int q ,int x)
{
    int mid;
    if(p==q)
    {
        if(a[q]==x)
        printf("Your element is found in array\n");
    else printf("not found\n");
    }
    else
    {
        mid=(p+q)/2;
        if(a[mid]==x) printf("Element found\n");
        else
            {
        if(a[mid]>x)
            return binarysearch(a,p,mid-1,x);
        else
            return binarysearch(a,mid+1,q,x);
        }
    }
}