二分法查找

int  search_binary_for(int a[],int n,int N)
{
	int low=0,high=n-1;
	int Mid;
	while(low<=high)
   	{
		Mid=(low+high+1)/2;
			if(N>a[Mid])
			{
				low=Mid+1;
			}
			else if(N<a[Mid])
			{
				high=Mid-1;
			}
			else
			{
              	return 0;
			}
		
			
   	}
	return -1;
}

void main(void)
{
	
	int a[]={0,1,2,3,4,5,6,7,8,9,10};
	for(int i=0;i<14;i++)
	if(-1!=search_binary_for(a,sizeof(a)/sizeof(int),i))
	{  
		printf("Hello,The data %d is find!\n",i);
	}
	else
	{
		printf("sorry,The data %d can't be found\n",i);
	}

	
	
}

int  search_binary_digui(int a[],int n,int N)
{
	static low,high,Mid;
	static int  count=0;
	if (count==0)
	{
		low=0;
		high=n-1;
		count++;
	}
	Mid=(low+high+1)/2;
   	if (low<=high)
   	{
		if(N>a[Mid])
		{
		
			low=Mid+1;
		}
		else if(N<a[Mid])
		{
			high=Mid-1;
			
		}
		else 
		{ 	
		    count=0;
			return 0;
		}
	}
	else
	{
		printf("no finid it\n");
		return -1;
	}
	
	   return  search_binary_digui(a,high-low+1,N);	  	
}