哪位大侠能帮小弟编个拆半查找算法，我在此多谢了！（越简单越好，最好有注释）

等两天吧!

while(left <= right)
{
mid = (right+left)/2;

if(num[mid] == findnum)
{
return mid+1;
}

else if(num[mid] < findnum)
{
left = mid+1;
}
else
right = mid-1;
}

警告：此不是汇编程序

#include <stdio.h>
int binsearch(int x,int v[],int low,int high) //low,high为数组中将要搜索的那片区域
{ if(high<low) return -1;

int mid=(high+low)/2;
if(x==v[mid]) return v[mid];
if(x<v[mid])
return binsearch(x,v,low,mid-1);
else
return binsearch(x,v,mid+1,high);
}
main()
{ int a[8],i,b,re;
printf("输入数组的各个元素!");
for(i=0;i<8;i++)
scanf("%d",&a[i]);
printf("输入要找的数!");
scanf("%d",&b);
re=binsearch(b,a,0,8);
printf("%d",re);
}

教材上有例题.