【数据结构】折半查找算法的递归实现 —— C++

#include
using namespace std;

int BinarySearch(int a[], int low, int high, int key) {
	if (low <= high) {
		int mid = (low + high) / 2;
		if (a[mid] == key) {
			return mid;
		} else if (a[mid] < key) {
			return BinarySearch(a, mid + 1, high, key);
		} else if (a[mid] > key) {
			return BinarySearch(a, low, mid - 1, key);
		}
	}
	return -1;
}

int main() {
	int a[6] = {1, 3, 5, 7, 9, 11};
	cout << BinarySearch(a, 0, 5, 7);
}