int halfSearch(int a[],int m,int x,int low,int high)
{
if(low>high)
return -1;
else
{
int mid=(low+high)/2;
if(x==a[mid])
return (mid+1);
if(x<a[mid])
return (halfSearch(a,x,low,mid));
else
return (halfSearch(a,x,mid,high));
}
}
2020-12-06
最新推荐文章于 2020-12-06 23:22:13 发布