Implementation of Binary Search in C

#include<stdio.h>

#include<conio.h>

int binarySearch(int[], int, int, int);

int binSearch(int[], int, int, int);

void main ()

{

    clrscr();

    int arr[10] = {16, 19, 20, 23, 45, 56, 78, 90, 96, 100};

    int item, location=-1,location1=-1;

    printf("Enter the item which you want to search: ");

    scanf("%d",&item);

    location = binarySearch(arr, 0, 9, item);

    location1 = binSearch(arr, 0, 9, item);

    printf("Using Recursive function!\n");

    if(location != -1)

    {

printf("Item found at location: %d",location);

    }

    else

    {

printf("Item not found");

    }

    printf("\n\nUsing Non-Recursive function!\n");

    if(location1 != -1)

    {

printf("Item found at location: %d",location);

    }

    else

    {

printf("Item not found");

    }

    getch();

}

int binarySearch(int a[], int beg, int end, int item)

{

    int mid;

    if(end >= beg)

    {

mid = (beg + end)/2;

if(a[mid] == item)

{

    return mid+1;

}

else if(a[mid] < item)

{

    return binarySearch(a,mid+1,end,item);

}

else

        {  

            return binarySearch(a,beg,mid-1,item);  

        }  

    }  

    return -1;   

}  

int binSearch(int a[], int beg, int end, int item)  

{  

    int mid;  

    while(end >= beg)   

    {     

        mid = (beg + end)/2;  

        if(a[mid] == item)  

        {  

            return mid+1;  

        }  

        else if(a[mid] < item)   

        {  

            beg = mid + 1;  

        }  

        else   

        {  

            end = mid - 1;   

        }    

    }  

    return -1;   

}