二分查找C++

#include<iostream>
using namespace std;

int BinarySearch(int arry[],int target)
{
	int l = 0;
	int r = sizeof(arry) - 1;
	while (l <= r)
	{
		int mid = (l + r) / 2;
		if (arry[mid] == target) return mid;
		else if (arry[mid] < target) l = mid + 1;
		else r = mid - 1;
	}
	return  -1;
}

int main()
{
	int target = 0;
	cin >> target;
	int arry [10]= { 1,3,5,7,9,14,16,23,25,27 };
	cout<<BinarySearch(arry, target);
	return 0;
}