折半查找法仅适用于对已有顺序的数组、数据进行操作
例如:要在数组arr[]={1,2,3,4,5,6,7,8,9,10};中查找key=7的位置;
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int binary_search(int arr[], int sz, int k)
{
int left = 0;//数组左下标
int right = sz-1;//数组最右侧下标
int mid = left + (right - left) / 2;
while (left <= right)
{
if (arr[mid] < k)
{
left = mid++;
}
else if(arr[mid] > k)
{
right = mid--;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int sz = sizeof(arr) / sizeof(arr[0]);//数组元素个数
//找到了返回下标
//找不到返回-1
int ret = binary_search(arr, sz, k);
if (ret == -1)
{
printf("没找到\n");
}
else
{
printf("找到了,下标为%d\n", ret);
}
return 0;
}