#include <stdio.h>
int binarysearch(int a[],int high,int low,int x){
if (low>high)
return -1;
int mid;
mid=(high+low)/2;
if(x>a[mid])
binarysearch(a,high,mid+1,x);
else if(x<a[mid])
binarysearch(a,mid-1,low,x);
else return mid;
}
void main(){
int a[5]={1,3,5,7,9},low=0,high=sizeof(a)/sizeof(a[0])-1,x,i;
scanf("%d",&x);
i=binarysearch(a,high,low,x);
if(i==-1)
printf("no");
else
printf("%d",i);
}
编写一个函数实现二分查找算法,并在主函数中进行测试
最新推荐文章于 2021-12-05 14:30:48 发布