二分查找法(c语言实现)
#include<stdio.h>
int binarySearch(int arr[],int len,int key)
{
int left=0;
int right=len-1;
while(left<=right)
{
int mid=left+((right-left)>>1);
if(arr[mid]<key)
{
left=mid+1;
}
else if(arr[mid]==key)
{
return mid;
}
else
{
right=mid-1;
}
}
return -1;
}
int main()
{
int arr[]={1,2,3,4,5,6,7};
int len=sizeof(arr)/sizeof(arr[0]);
int ret=binarySearch(arr,len,6);
if(ret!=-1)
{
printf("找到了该数据:”,arr[ret]);
printf("他的下标是:%d\n",ret);
}
else
{
printf(“没有找到该数据:%d\n",arr[ret]);
printf("他的下标是:%d\n",ret);
}
return 0;
}