折半查找

#include<stdio.h>
void find(int n,int low,int high,int *a);
void find(int n,int low,int high,int*a)
{
int ok=1;
int mid=(low+high)/2;
if(n<a[low]||n>a[high])
{
printf("没找到");
return;
}

if(n<a[mid])
{

find(n,low,mid-1,a);

}
else if(n>a[mid])
{


find(n,mid+1,high,a);
}
else 
{
printf("Yes");
return ;
}


 
}
int main()
{
int a[10]={1,5,6,9,10,15,18,25,36,45};
int low=0;
int high=9;

find(666,low,high,a);
}