#include<stdio.h>
int main()
{
int k = 0;
scanf("%d", &k);
int arr[] = { 1,2,3,4,5,6,7,8,9 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]) - 1;
while (left<=right)
{
int mid = (left + right) / 2;
//如果数据过大,用:mid=left+(right-left)/2,这样不会使数据溢出
if (arr[mid] < k)
left = mid + 1;
else if (arr[mid] > k)
right = mid - 1;
else
{
printf("找到了,下标是%d\n", mid);
break;
}
}
if (left > right)
printf("找不到\n");
return 0;
}
⼆分查找(折半查找)
最新推荐文章于 2024-09-14 22:25:23 发布