#include<stdio.h>
int ChaZhao(int arr[], int n,int size)
{
int left = 0;
int right = size - 1;
while (left < right)
{
int mid = (left + right) / 2;
if (arr[mid] < n)
{
left = mid + 1;
}
else if (arr[mid] > n)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 0;
scanf_s("%d", &k);
int sz = sizeof(arr) / sizeof(arr[0]);
int ret=ChaZhao(arr,k,sz);
if (ret == -1)
{
printf("找不到\n");
}
else
{
printf("找到了下标为%d\n",ret);
}
return 0;
}
二分查找
最新推荐文章于 2024-09-10 15:28:21 发布