8.2.3 二分查找

• 二分查找

1. 递归代码

#include <iostream>

using namespace std;

//查找序列中是否有元素 elem 
//二分查找，只适用于在有序序列中查找
//时间复杂度O(logn) 
int BinarySearch(int *A, int elem, int l, int r) {
	int m = (l + r) / 2;
	if (A[m] == elem) return 1;		//找着了，返回真值 
	
	if (l >= r) return 0; 			//区间只有一个元素了还未找着,返回假值 
	
	else {
		if (elem > A[m]) 
			return BinarySearch(A, elem, m + 1 , r);		//在右半边继续查找 
		else
			return BinarySearch(A, elem, l, m - 1);		//在左半边继续查找 
	} 
}

int main() {
	int A[8] = {1, 2, 3, 4, 5, 6, 7, 8};
	cout << BinarySearch(A, 9, 0, 8 - 1) << endl;
	
	return 0;
} 

2. 非递归代码

#include <iostream>

using namespace std;

int main() {
	int A[8] = {1, 2, 3, 4, 5, 6, 7, 8};
	int len = 8;
	int elem = 66;

	int l = 0, r = len - 1;
	int m = (l + r) / 2;
	while (A[m] != elem && l < r) {
		if (elem > A[m]) 
			l = m + 1;
		else 
			r = m - 1;
			
		m = (l + r) / 2;
	} 
	if (A[m] == elem) cout << "找到咯\n";
	else cout << "没有\n";
	
	return 0;
}