//折半查找
int binary_search(int arr[],int key,int left,int right)
{
while (left <= right)//左下标小于等于右下标
{
int mid = (right - left) / 2 + left;
if (arr[mid] > key)
{
right = mid - 1;
}
else if (arr[mid] < key)
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]);
int key = 0;
int mid = 0;
printf("请输入要查找的数:");
scanf("%d",&key);
int ret = binary_search(arr,key,left,right);
if (ret == -1)
printf("找不到!\n");
else
printf("找到了:%d\n",ret);
system("pause");
return 0;
}
c语言写折半查找
最新推荐文章于 2019-09-26 17:37:59 发布