69,372
社区成员
发帖
与我相关
我的任务
分享
int bisearch(int v[],int x,int low,int high)
{
int mid=(low+high)/2;
while(low < high&&x!=v[mid])
{
if(x>v[mid])
low=mid+1;
else
high=mid-1;
mid=(low+high)/2;
}
if(x==v[mid])
return mid;
else if(low >= high)
return (x>v[low])?low+1:low;
}
试一下这个。
改一下while循环的条件,另外,再改一下最后一个else if判断条件。即将上面的low <= high等号放到下面去判断int bisearch(int v[],int x,int low,int high)
{
int mid=(low+high)/2;
while(low<=high&&x!=v[mid])
{
if(x>v[mid])
low=mid+1;
else
high=mid-1;
mid=(low+high)/2;
}
if(x==v[mid])
return mid;
else if(low>high)
return (x>v[low])?low+1:low;
}
int binarySearch(int a[], int item, int low, int high)
{
if (high <= low)
return (item > a[low])? (low + 1): low;
int mid = (low + high)/2;
if(item == a[mid])
return mid+1;
if(item > a[mid])
return binarySearch(a, item, mid+1, high);
return binarySearch(a, item, low, mid-1);
}
int bisearch(int v[],int x,int low,int high)
{
int mid;
while( low<high-1)
{
mid= low+(high-low)/2;
if(x>v[mid])
{
low=mid;
}
else
{
high=mid;
}
}
if( x==v[low])
return low;
else if( x==v[high])
return high;
else
return -1;
}