#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k ;
scanf_s("%d",&k);
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)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("找到下标为:%d", mid);
break;
}
}
if(k>sz-1)
{
printf("找不到");
}
return 0;
}
11-20
765
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-30
779
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-29
3534
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-30
312
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
05-05