#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 0;
printf("输入一个数:");
scanf_s("%d", &k);
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)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("已找到,下标为:%d", mid);
break;
}
}
if (left > right)
{
printf("找不到");
}
return 0;
}
在一个有序数组中查找具体的某个数,
二分查找。