折半查找非递归方法（c/c++）

//思路：让low high分别指向数组的首和尾，每一次让中间值mid和要查找的值key比较，每比较一次就会缩小一般的查找范围，前提数组是要有序的
#include<stdio.h>
int search(int a[], int key)
{
	int low = 0, high = 8;
	int mid;
	while (low <= high)
	{
		mid =(low + high) / 2;
		if (key ==a[mid])
			return mid;
		else if (key>mid)
			low = mid + 1;
		else if (key<mid)
			high = mid - 1;
	}
	return 0;
}
int main()
{
	int a[9] = { 1, 3, 4, 5, 7, 8, 9, 11, 13 };
	int key = 9, n;
	n = search(a, key);
	printf("n=%d\n", n);
	return 0;
}

运行结果