#include <stdio.h>
int BinSearch(int arr[],int len,int key)
{
int low=0;
int high=len-1;
int mid;
while (low<high)
{
mid=(low+high)/2;
if (arr[mid]==key)
{
return mid;
}
else if (arr[mid]<key)//在右边找
{
low=mid+1;
}
else high=mid-1;
}
return -1;
}
int main()
{ int arr[]={1,3,5,7,9,10,13,15,17};
int index;
for (int i=0;i<10;i++)
{
index=BinSearch(arr,10,arr[i]);
printf("%d\n",index);
}
printf("%d\n",BinSearch(arr,10,-10));
printf("%d\n",BinSearch(arr,10,35));
printf("%d\n",BinSearch(arr,10,100));
return 0;
}
在长度为len的数组arr中查找关键字key,找到了返回下标,没有找到返回-1
最新推荐文章于 2024-04-18 11:28:23 发布