#include <stdio.h>
#include <stdlib.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5 };
int to_find =3;
int left=0;
int right = sizeof(arr) / sizeof(arr[0]) - 1;
int mid = 0;
while (left <= right)
{
mid = (left + right) / 2;
if (to_find <arr[mid])
{
right = mid - 1;
}
else if (to_find>arr[mid])
{
left = mid + 1;
}
else
{
break;
}
}
if (left <= right)
{
printf(“找到了!下标为:%d\n”, mid);
}
else
{
printf(“没找到!”);
}
system(“pause”);
return 0;
}
写代码可以在整型有序数组中查找想要的数字
最新推荐文章于 2023-08-06 22:16:05 发布