#include<stdio.h>
int main()
{
//有序数组利用二分查找关键字下标
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;
int k = 6 ;
while (left <= right)
{
//int mid = (left + right) / 2;
//求中间值的第二种写法,这样写如果right非常大求出的mid就不会越界
int mid = left + (right - left) / 2;
if (arr[mid] < k)
{
//只要确定中间值mid与k比较,挪动left和right
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到\n");
}
return 0;
}