Iterative Binary Search

binsearch.c

int binsearch(int *,int,int,int);
int binsearch(int *a,int low,int high,int key)
{
    while(high>=low)
    {
        int mid=(low+high)/2;
        if(a[mid]==key)
            return 1;
        else if(a[mid]>key)
            high=mid-1;
        else
            low=mid+1;
	}
    return 0;
}