int binary_search(int arr[],int k, int sz)
{
int left = 0;
int right = sz-1;
int mid = left + (right - left) / 2;
while (left <= right)
{
if (arr[mid] < k)
{
int left = mid++;
}
else if (arr[mid] > k)
{
int right = mid--;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int i = 0;
scanf("%d", &i);
int arr[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13 };
int sz = sizeof(arr) / sizeof(arr[0]);
int ret = binary_search(arr,i, sz);
if (ret == -1)
{
printf("找不到\n");
}
else
{
printf("找到了,下标为%d",ret );
}
return 0;
}
C语言练习--写一个函数,实现一个整形有序数组的二分查找
于 2024-08-05 18:39:17 首次发布