#include<stdio.h>
int binary_search(int arr[], int k, int left, int right)
{
while(left <= right)
{
int mid=left+(right-left)/2;
if(arr[mid]==k)
return mid;
if(arr[mid]<k)
left=mid+1;
else
right=mid-1;
}
return -1;
}//定义一个函数int binary_search(int arr[], int k, int left, int right)用来进行查找数字
int main()
{
int arr[]={1,2,3,4,5,6,7,8,9,10};
int i = 0;
int sz =sizeof(arr)/sizeof(arr[0]);
int n = 4;
i = binary_search(arr,n,2,7);
if(i==-1)
{
printf("找不到\n");
}
else
{
printf("找到了,下标是%d\n",i);
}
return 0;
}