二分查找算法

#include
#include

int main()
{
	int array[] = { 1,4,7,9,22,56,89,122,234,556,789 };
	int length = sizeof(array) / sizeof(array[0]);
	int index = -1,mid;
	int low = 0, high = length - 1;
	int target = 122;
	while (low <= high)
	{
		mid = (low + high) / 2;
		if (array[mid] == target)
		{
			index = mid;
			break;
		}
		else if (array[mid] < target)
		{
			low = mid + 1;
		}
		else
		{
			high = mid - 1;

		}
	}
		if (index != -1)
			printf("目标元素是%d，在数组中的位置为array[%d]", target,index);

}