请高手赐教！

help

No body know??

一定要递归吗？why?

/*没有测试,大概思路就是这个样子,返回1表示查找成功,否则失败,要注意初始时a[]是从小到大排好序的.*/

int digui(int a[],int l,int r,int x)
{
int mid;
mid=(l+d)/2;
if(l<=r)
{
if(a[mid]==x)
{
return(1);
}
else
{
if(x<a[mid])
{
digui(a,l,mid-1,x);
}
else
{
digui(a,mid+1,r,x);
}
}
}
return(0);
}

[此贴子已经被作者于2006-11-12 22:30:04编辑过]

/* binsearch函数：在v[0]<=v[1]<=v[2]<=……<=v[n-1]中查找x */
int binsearch(int x, int v[], int n)
{
int low, high, mid;

low = 0;
high = n - 1;
while (low <= high) {
mid = (low+high) / 2;
if (x < v[mid])
high = mid - 1;
else if (x > v[mid])
low = mid + 1;
else /* 找到了匹配的值 */
return mid;
}
return -1; /* 没有匹配的值 */
}