递归:
int bf(int a[],int low,int high,int key)
{
int mid;
mid=(low+high)/2;
while(low<=high)
{
if(a[mid]==key)
return mid;
else if(a[mid]>key)
return bf(a,low,mid-1,key);
else
return bf(a,mid+1,high,key);
}
return -1;
}