二分查找

#include<iostream>
#include<vector>
using namespace std;
class solution
{
public:
int binary_find(vector<int> v,int key,int start,int end)
{
if (start <= end)
{
int mid =(end +start) / 2;
if (key == v[mid])
return mid;
if (key < v[mid])
return binary_find(v, key, start, mid - 1);
if (key>v[mid])
return binary_find(v, key, mid + 1, end);
}
else
{
return -1;
}
}
};
int main()
{
int n;
int key;
cin >> key;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
v.push_back(temp);
}
solution s;
int re;
re=s.binary_find(v,key,0,v.size()-1);
cout << re;
return 0;
}