编辑代码

#include<iostream>
#include<vector>
using namespace std;
int search_binary(vector<int>v, int value)
{
	int low = 0;
	int high = v.size() - 1;
	int mid = (low + high) / 2;
	while (low <= high)
	{

		if (v[mid] == value)
		{
			return mid;
		}
		else if (value < v[mid])
		{
			high = mid-1;
		}
		else
		{
			low = mid + 1;
		}
		mid= (low + high) / 2;
	}
	return -1;
}
int  main()
{
	vector<int>v{ 8,11,19,23,27,33,45,55,67,98 };
	cout << "27在数组中排在第"<<search_binary(v, 27)+1<<"个";
    return 0;
}