int main()//用折半查找算法/二分查找算法
{
int arr[] = { 1,2,3,4,5,6,7,8,9 };
int sz = sizeof arr / sizeof(arr[0]);//这个数组中元素个数、
int k = 7;
int left = 0;//左下标
int right = sz-1;//右下标
while (left<=right)
{
int sum = (left + right) / 2;
if (arr[sum] < k)
{
left = sum + 1;
}
else if (arr[sum] > k)
{
right = sum - 1;
}
else
{
printf("找到了,下标:%d\n", sum);
break;
}
}
if (left > right)
printf("找不到了\n");
return 0;
}