来一个C语言二分法查找、找到 输出 找不到 给出提示 10个整数的就行了~

#include
void main()
{
int beg=0,end=0,mid=0;
int num=0;
int a[8]={1,3,5,9,11,24,56,89};
printf("请输入要查找的数！\n");
scanf("%d",&num);
beg=0;
end=7;
while(beg {
mid=(beg+end)/2;
if(a[mid]==num)
{
printf("第%d个元素是要找的元素\n",mid+1);
break;
}
else if(a[mid] {
beg=mid+1;
}
else
{
end=mid-1;
}
}
if(beg>=end)
{
printf("查找失败!\n");
}
}

递归版的(数组要有序)：

int biSearch(int a[], int left, int right, int key)
{
if(left > right) return -1; //未找到
mid = (left + right)/2;
if(a[mid] == key) return mid; //返回找到的下标
return (a[mid] < key ? biSearch(a, mid+1, right) : biSearch(a, left, mid-1));
}