二分查找

二分查找时间复杂度是O(logn)，循环的方法时间复杂度是O(n)。

循环实现：

//循环法二分查找.数组必须有序
int binarySerachA(int * arr, int key, int length) {
	int left = 0;
	int right = length - 1;
	int middle = 0;
	while (left <= right) {
		middle = (left + right) / 2;
		if (arr[middle] == key)
			return middle;
		else if (arr[middle] < key)
			left = middle + 1;
		else
			right = middle - 1;
	}
	return -1;
}

递归实现：

//递归法二分查找
int binarySerachB(int * arr, int key, int left, int right) {
	if (left > right)
		return -1;
	int middle = (left + right) / 2;
	if (arr[middle] == key)
		return middle;
	else if (arr[middle] > key)
		right = middle - 1;
	else
		left = middle + 1;
	binarySerachB(arr, key, left, right);
}

运行代码：

#include "stdafx.h"
#include <iostream>

using namespace std;

int binarySerachA(int * arr, int key, int length);
int binarySerachB(int * arr, int key, int left, int right);

int main()
{
	int arr[] = { 1,2,3,4,5,7,8 };
	int loc1 = binarySerachB(arr, 5, 0, 6);
	int loc2 = binarySerachA(arr, 5, 7);
	cout << loc1 << endl << loc2 << endl;

	system("pause");
}