C程序设计（第四版） 谭浩强 习题6.9 折半查找（个人设计）

//折半查找
#include<stdio.h>
int main()
{
	int n,a[] = { 1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17};
	int len = sizeof(a)/sizeof(a[0]);
	int low = 0, hight = len - 1, mid;
	int locd = 1;
	printf("enter number you want to find:\n");
	scanf_s("%d", &n);
	while (low<=hight)
	{
		mid = (hight + low) / 2;
		if (n==mid)
		{
			printf("the number is %dth", mid + 1);
			locd = 0;
			break;
		}
		else if (n<mid)
		{
			hight = mid - 1;
		}
		else if (n>mid)
		{
			low = mid + 1;
		}
	}
	if (locd)
	{
		printf("no find");
	}
	return 0;
}