int BinarySearch(int a[],int n,int key)
{
int mid,left=0,right=n-1;
while(left<=right)
{
mid=(left+right)/2;
if(key==a[mid])
return mid;
else if(key<a[mid])
right=mid-1;
else
left=mid+1;
}
return -1;
}
int BinarySearch(int a[],int n,int key)
{
int mid,left=0,right=n-1;
while(left<=right)
{
mid=(left+right)/2;
if(key==a[mid])
return mid;
else if(key<a[mid])
right=mid-1;
else
left=mid+1;
}
return -1;
}