题目:
写一个函数,实现一个整形有序数组的二分查找
代码如下:
#include <stdio.h>
int binary_search(int arr[], int i, int sz)
{
int left = 0, right = sz - 1;
while (left <= right)
{
int mid = left + (right - left) / 2;//防止数值溢出所导致的数据错误
if (arr[mid] < i)
{
left = mid + 1;
}
else if (arr[mid] > i)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
int i = 0;
int sz = sizeof(arr) / sizeof(arr[0]); //元素个数
scanf("%d", &i);
int ret = binary_search(arr, i, sz);
if (ret == -1)
{
printf("没找到\n");
}
else
{
printf("找到了,它的下标是%d\n", ret);
}
return 0;
}