折半查找的实现代码：

递归实现：

#include 

// 二分法：递归
int searchBin(int arr[], int x, int low, int high) {
	int mid;

	if(low > high)
		return -1;
	mid = (low + high) / 2;
	if(x == arr[mid])
		return mid;
	else if(x < arr[mid])
		return searchBin(arr, x, low, mid-1);
	else
		return searchBin(arr, x, mid+1, high);
}

int main(int argc, const char * argv[]) {
	// insert code here...
	int arr[] = {8, 10, 12, 15, 25, 27, 30, 38}; // 初始化数组
	int len, x, loc; // len存储数组的实际长度,x要查找的数, loc位置

	len = sizeof(arr) / sizeof(arr[0]); // 整个数组长度
	std::cout > x) {
		loc = searchBin(arr, x, 0, len-1); // 调用二分查找函数
		if(loc >= 0)
			std::cout