此题的解决思路为:定义一个数组,设定它的左右下标,同时定义一个中间下标mid,每次进行折半查找,若要查找的数比mid小,则右下标等于mid-1,若要查找的数比mid大,则左下标等于mid+1。若要查找的数等于mid,则循环停止。
具体代码如下:
#include<stdio.h>
#include<string.h>
int main()
{
int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int k = 7;
int left = arr[0];
int right = sizeof(arr) / sizeof(arr[0]) - 1;
while (left<=right)
{
int mid = left + (right - left) / 2;
if (arr[mid] == k)
{
printf("找到了,下标为:%d\n",mid);
break;
}
else if (arr[mid] <= k)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
if (left > right)
{
printf("没有找到\n");
}
system("pause");
return 0;
}
若将折半查找法定义为一个函数
则具体代码如下:
#include <stdio.h>
#include <string.h>
int binary_search(int arr[], int k,int sz)
{
int left = 0;
int right = sz;
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] == k)
{
return mid;
}
else if (arr[mid] <= k)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
if (left > right)
{
return -1;
}
}
int main()
{
int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int k = 7;
int left = 0;
int sz = sizeof (arr) / sizeof (arr[0]) - 1;
int right = sz;
int ret = binary_search(arr, k, sz);
if (ret == -1)
{
printf("没有找到\n");
}
else
{
printf("找到了,下标为:%d\n",mid);
}
system("pause");
return 0;
}