二分查找

非递归方法思想：

前提：待查找对象必须是有序，比如一个从小到大或从大到小的数组。设查找起始范围和结束范围分别为start和end，中值为mid，数组为srcArr[]。

过程：

有序列表中，将待查找值key与查找范围内（start~end）的中值srcArr[mid]作比较，有如下可能：

1.待查找值key小于中值srcArr[mid]，则将查找范围缩小到0~mid-1。

2.待查找值key大于中值srcArr[mid]，则将查找范围缩小到mid+1~end。

3.待查找值key等于中值srcArr[mid]，则返回mid。

4.数组srcArr内无法找到待查找值key，则返回-1。

返回值：

若成功，则返回查找到的key值所在的下标；失败则返回-1

简单源码：

#include <string.h>
#include <iostream>

using namespace std;

int binSearch(int srcArr[], int key, int len)
{
	int cnt = 0;
	int mid;
	int start = 0;
	int end = len - 1;
	while (start <= end)
	{
		mid = (end + start) / 2;
		if (key < srcArr[mid])
		{
			cout << "while 1 mid" << srcArr[mid] << endl;
			cout << "while 1 " << cnt++ << endl;
			end = mid - 1;
		}else 
			if (key > srcArr[mid])
			{
				cout << "while 1 mid" << srcArr[mid] << endl;
				cout << "while 2 " << cnt++ << endl;
				start = mid + 1;
			}else
				{
					return mid;
				}
		
	}
	return -1;
}

int main(void){
	int srcArr[] = {3,6,9,11,13,15,20,25,31,39,41,59,69,73,83,123};
	int len = sizeof(srcArr) / sizeof(srcArr[0]);
	int key_index = binSearch(srcArr, 123, len);
	cout << "length of array is " << len << endl;
	cout << "index of  key   is " << key_index << endl;
	

	return 0;
}

结果：

递归方法：

#include <string.h>
#include <iostream>

using namespace std;

int binSearch(int srcArr[], int key, int len)
{
	int cnt = 0;
	int mid;
	int start = 0;
	int end = len - 1;
	while (start <= end)
	{
		mid = (end + start) / 2;
		if (key < srcArr[mid])
		{
			cout << "while 1 mid" << srcArr[mid] << endl;
			cout << "while 1 " << cnt++ << endl;
			end = mid - 1;
		}else 
			if (key > srcArr[mid])
			{
				cout << "while 1 mid" << srcArr[mid] << endl;
				cout << "while 2 " << cnt++ << endl;
				start = mid + 1;
			}else
				{
					return mid;
				}
		
	}
	return -1;
}

int iterBinSearch(int srcArr[], int key, int start, int end)
{
	int mid = (start + end) / 2;
	if (key < srcArr[mid])
	{
		return iterBinSearch(srcArr, key, start, mid - 1);
	}
	else
		if (key > srcArr[mid])
		{
			return iterBinSearch(srcArr, key, mid + 1, end);
		}
		else
			{
				return mid;
			}
			return -1;
}

int main(void){
	int srcArr[] = {3,6,9,11,13,15,20,25,31,39,41,59,69,73,83,123};
	int len = sizeof(srcArr) / sizeof(srcArr[0]);
	//int key_index = binSearch(srcArr, 123, len);
	int key_index = iterBinSearch(srcArr, 123, 0, len);
	cout << "length of array is " << len << endl;
	cout << "index of  key   is " << key_index << endl;
	

	return 0;
}

结果：