二分查找

#include
#include
int erFensearch(int a[],int n,int key)
{
int low=0;
int high=n-1;
while(low<=high)
{
int mid=(low+high)/2;
if(a[mid]<key) low=mid+1;
else if(a[mid]>key) high=mid-1;
else return mid;
}
return -1;
}

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

int main()
{
int a[10]={12,15,18,28,36,45,85,164,232,311};
int c;
c=Nodigui(a,0,9,36);
printf("%d",c);
return 0;
}