#include<stdio.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int k = 5;
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
while (left <= right)
{
//int mid = (left + right) / 2;
//以防left + right整型溢出
//int mid = left + (right - left) / 2;
//为了速度更快,采用位运算
int mid = left + ((right - left) >> 1);
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;
}
二分法的改进
最新推荐文章于 2024-08-09 00:05:38 发布