编写代码在一个整形有序数组中查找具体的某个数
要求:找到了就打印数字所在的下标,找不到则输出:找不到。
#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,5,6,8,9,10,11 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]) - 1;
int k = 0;
scanf("%d", &k);
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] == k)
{
printf("找到了,下标为%d\n", mid);
break;
}
else if (arr[mid] < k)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
if (left > right)
{
printf("没找到\n");
}
return 0;
}