Binary Search (Recursive)

#include<stdio.h>

int srch (int ar[], int r, int x, int l)
{
    if (r>=1) {
        int mid= l+(r-1)/2;
        if (x==ar[mid]) {
            return mid;
        }
        else if (x>ar[mid]) {
            return srch(ar, r, x, mid+1);
        }
        else {
            return srch(ar, mid-1, x, l);
        }
    }
    return -1;
}

void swp (int *p, int *q)
{
    int tmp;
    tmp=*p;
    *p=*q;
    *q=tmp;
}

void srt(int a[], int n)
{
    int i, j;
    for (i=0; i<n-1; i++) {
        for (j=i+1; j<n; j++) {
            if (a[i]>a[j]) {
                swp(&a[i], &a[j]);
            }
        }
    }
}

int main()
{
    int n, i, j;
    scanf("%d", &n);
    int a[n];
    for (i=0; i<n; i++) {
        scanf("%d", &a[i]);
    }
    srt(a, n);
    int x;
    scanf("%d", &x);
    int z=srch(a, n-1, x, 0);
    if (z==-1) {
        printf("%d is not present in the array.\n", x);
    }
    else {
        printf("%d is present in the array. It's the no.%d element after sorting.\n", x, z+1);
    }
    return 0;
}