int main()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int k = 7;
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)
{
right = mid - 1;
}
else if (arr[mid] < k)
{
left = mid + 1;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
return 0;
}
(二分法)在一个有序的数组中查找某个数字
最新推荐文章于 2023-01-18 20:10:35 发布