递归与迭代的折半查找

#include <iostream>

using namespace std;

int BinarySearch_I(int *a, const int x, const int n);
int BinarySearch_R(int *a, const int x, const int left, const int right);

int main()
{
	int m[] = {1,2,3,4,5,6,7,8,9};
	int 结果;
	int num = 77;
	if((结果 = BinarySearch_R(m,num,0,8)) < 0)
	{
		cout << "迭代算法：没有找到！" << endl;
	}
	else
	{
		cout << "迭代算法：在m[" << 结果 << "]找到了:" << num << endl;
	}


	if((结果 = BinarySearch_I(m,num,9)) < 0)
	{
		cout << "递归算法：没有找到！" << endl;
	}
	else
	{
		cout << "递归算法：在m[" << 结果 << "]找到了:" << num << endl;
	}

	return 0;
}

int BinarySearch_I(int *a, const int x, const int n) // 这个是用迭代的折半查找，
{
	int left = 0, right = n - 1;
	while(left <= right)
	{
		int middle = (left + right) / 2;
		if(x < a[middle])
			right = middle - 1;
		else if(x > a[middle])
			left = middle + 1;
		else
			return middle;
	}
	return -1;
}

int BinarySearch_R(int *a, const int x, const int left, const int right) // 这个是用递归的折半查找，
{
	if(left <= right)
	{
		int middle = (left + right) / 2;
		if(x < a[middle])
			return BinarySearch_R(a, x, left, middle - 1);
		else if(x > a[middle]) 
			return BinarySearch_R(a, x, middle + 1, right);
		else 
			return middle;
	}
	return -1;
}