递归实现二分查找

#include<iostream>
using namespace std;

int binarySearch(int *m, int n,int left, int right)
{
	if (left > right) return -1;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (n > m[mid]) return binarySearch(m, n, mid + 1, right);
		else if (n < m[mid]) return binarySearch(m, n, left, mid-1);
		else return mid;
	}

}

int main()
{
	int a[] = { 1,2,3,4,5,6 };
	int b = 5;
	int c = binarySearch(a, b, 0, 5);
	cout << c+1 <<endl;
	cin.get();
	return 0;
}