int main()
{
int arr[] = {1,2,3,4,5,6,7,8,9,10}; // 定义数组
int sz = sizeof(arr) / sizeof(arr[0]); //计算数组的个数
int x = 0;
scanf("%d", &x); // 输入需要查找的数字
int left = 0;
int right = sz -1;
int i;
for(i = 0; i < sz ; i++)
{
int mid = (left+right) / 2;
if(k > arr[mid])
{
left = mid + 1;
}
else if(k < arr[mid])
{
right = mid - 1;
}
else
{
printf("找到了,下标为:%d\n", mid);
break;
}
}
if(left > right)
{
printf("找不到\n");
}
return 0;
}