折半查找法（递归）

#include<stdio.h>

int bin_search(int num[],int low,int high,int key)
{
	int mid;
	if(high >= low)
	{
		mid = (high+low)/2;
		if(num[mid] == key)
		{
			return mid;
		}
		else if(num[mid] > key)
		{
			return bin_search(num,low,mid-1,key);
		}
		else if(num[mid] < key)
		{
			return bin_search(num,mid+1,high,key);
		}
	}
	else
	{
		return -1;
	}
}
int main()
{
	int num[] = {6,7,8,9,10};
	int a = bin_search(num,0,4,8);
	printf("%d",a);
	return 0;
}