递归二分查找

#include<stdio.h>
int fun(int a[],int begin,int end,int x)
{
	int mid=(begin+end)/2;
	if(begin>end)//表示没有找到 
	return -1;
	if(x<a[mid])
	return fun(a,begin,mid-1,x);
	else if(x>a[mid])
	return fun(a,mid+1,end,x);
	else 
	return mid;
}
main()
{
	int a[5]={1,2,4,8,9},x;
	printf("输入要查找的数：");
	scanf("%d",&x);
	printf("下标是：%d",fun(a,0,4,x));
}