#include <stdio.h>
int main()
{
int arr[10] = { 0,1,2,3,4,5,6,7,8,9 };
int k = 6;//确定要查找的元素
int sz = sizeof(arr) / sizeof(arr[0]);//计算有序数组的长度
int mid = 0;
int left = 0;//最左端下标
int right = sz - 1;//最右端下标
int flag = 0;//标记数字
while (left <= right)
{
int mid = (left + right) / 2;//折半
if (arr[mid] < k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
flag = 1;
printf("找到了,下标是%d", mid);
break;
}
}
if (flag == 0)
{
printf("找不到");
}
return 0;
}
运行结果: