二分法的递归实现

#include<iostream>
#include<iomanip>
#include<cmath>
#include<string.h>
using namespace std;
template<class T>
T find(const T list[],int low,int high,T x){
	if(low>=high)//递归出口
		return -1;
	else{
		int mid=(low+high)/2;
		if(x<list[mid])
			return find(list,low,mid-1,x);
		if(x>list[mid])
			return find(list,mid+1,high,x);
		else
			return mid;
	}
}
template<class T>
T find(const T list[],T x){//递归辅助函数
	return find(list,0,sizeof(list),x);
}
int main(){
	int a[5]={1,2,3,4,5};
 	int n;
 	while(cin>>n){
  		cout<<find<int>(a,n)<<endl;
 	}
}