int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int main()
{
int x = 11;
int az = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = az - 1;
while (left <= right)
{
int mid = (left + right) / 2;
if (x > arr[mid])
left = mid + 1;
else if (x < arr[mid])
right = mid - 1;
else
{
printf("已找到该数字,该数字的下标是%d", mid);
break;
}
}
if (left > right)
printf("找不到");
return 0;
}