int f(int m,int n,int a[],int x)
{
if(m<=n)
{
int mid=(n+m)/2;
if(a[mid]==x) return mid+1;
else if(a[mid]<x) return f(mid+1,n,a,x);
else return f(m,mid-1,a,x);
}
else return -1;
}
二分查找递归
猜你喜欢
转载自blog.csdn.net/weixin_44153125/article/details/88586425
今日推荐
周排行