递归式 --- 二分查找

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
	
int Search(vector<int>& v,int left,int right,int key)
{
	int pos = -1;
	if(left <= right)
	{
		int mid = (right - left +1)/2 + left;
		if(key < v[mid])
			pos = Search(v,left,mid-1,key);
		else if(key > v[mid])
		{
			pos = Search(v,mid+1,right,key);
		}
		else
		{
			pos = mid;
		}
	}
	return pos;
}
		
int SearchValue(vector<int> &v,int n,int key)//这个n是长度
{
	if(n<1)
		return -1;
	else
		return Search(v,0,n-1,key);
}
int main()
{
	int n,tmp,value;
	cin>>n;
	vector<int> v;
	for(int i = 0;i<n;i++)
	{
		cin>>tmp;
		v.push_back(tmp);
	}
	cin >> value;
	int index = SearchValue(v,n,value);
	cout<<index;
	return 0;
}