int k = 0;
printf("输入要找的数字\n");
scanf("%d",&k);
int arr[]= {1,2,3,4,5,6,7,8,9,10};
int sz = sizeof(arr)/sizeof(arr[0]);
int left = 0;
int right = sz-1;
while(left<=right)
{
int mid = (left+right)/2;
if(arr[mid] > k)
{
right = mid -1;
}
else if(arr[mid] < k)
{
left = mid + 1;
}
else
{
printf("找到了 下标是%d\n",mid);
break;
}
}
if(left>right)
{
printf("没有这个数\n");
}
return 0;
C语言二分法寻找数组内数字
最新推荐文章于 2024-08-09 18:27:02 发布