#include
int a[]={1,2,3,4,5,6,7,8,8,9,10};
int main()
{
int n;
printf("输入你想要找的数:");
scanf("%d",&n);
int left=0;
int s=sizeof(a)/sizeof(a[0]);
int right=s-1;
while(left<=right)
{
int mid=(left+right)/2;
if(n
{
right=mid-1;
}
else if(n>a[mid])
{
left=mid+1;
}
else {printf("找到了:%d",n);break;}
if(left>right)
{printf("没有");}
}
return 0;
}
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)