之前我们实现了猜数字游戏,这个时候我们来看一下折半查找算法,其实猜数字游戏和折半查找算法很相像。
折半查找算法
对于折半查找算法,我们可以这么理解:
代码如下:
实现在主函数内:
#include<stdio.h>
#include<stdlib.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]) - 1;
int key = 7;
int mid = 0;
while (left <= right)
{
mid = left + ((right - left) >> 1);
if (arr[mid]>key)
{
right = mid - 1;
}
else if (arr[mid] < key)
{
left = mid + 1;
}
else
break;
}
if (left <= right)
printf("找到了,下标是%d\n", mid);
else
printf("找不到\n");
system("pause");
}
结果如下:
实现一个二分查找函数:
#include<stdio.h>
#include<stdlib.h>
int bin_search(int arr[], int left, int right, int key)
{
int mid = 0;
while (left <= right)
{
mid = left + ((right - left) >> 1);
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]) - 1;
int mid = 0;
int i = bin_search(arr, 1, 10, 7);
if (i == -1)
printf("没找到!\n");
else
printf("找到了,下标为:%d\n",i);
system("pause");
return 0;
}
结果为: