二分查找算法

#include <iostream>
using namespace std;

int BinarySerach(int *array, int size, int val)
{
	int l = 0, r = size -1, tmp;
	while (l < r)
	{
		tmp = (l+r)/2;

		if (val == array[tmp])
		{
			return tmp;
		}
		else if (array[tmp] < val)
		{
			l = tmp + 1;
		}
		else 
		{
			r = tmp - 1;
		}
	}
	return -1;
}

int _tmain(int argc, _TCHAR* argv[])
{
	int arr[10] = {12, 15, 17, 19, 20, 22, 25, 29, 32, 33};
	cout <<BinarySerach(arr,10,22)<<endl;
}