#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int binary_search(int arr[], int k,int sz)
{
//算法的实现
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = (left+right)/2;
if (arr[mid] < k)//k为下表数
{
left = mid + 1;//小的话是在中间左面故left+1
}
else if (arr[mid] > k)
{
right = mid - 1;//大的话是在中间右面故right-1
}
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]);//求数组的元素个数
int ret = binary_search(arr, k,sz);
if (ret == -1)
{
printf("找不到指定的数字\n");
}
else
{
printf("找到了,下标是: %d\n", ret);
}
}
k = 7