# include <stdio.h>
int main (void)
{
int a[10]={1,3,6,9,12,37,45,49,79,99};
int n,high,low,mid,found=0;
scanf("%d",&n);
high = 9 ;
low = 0;
while(low < high)
{
mid = (low+high)/2;
if(n == a[mid])
{
found=1;
break;
}
else if(n > a[mid])
low = mid+1;
else if(n < a[mid])
high = mid-1;
}
if(found == 1)
printf("Yes!");
else
printf("No!");
return 0;
}
二分法(折半查找)
最新推荐文章于 2022-07-03 11:28:08 发布