二分查找

二分查找

二分查找也称折半查找
原理图：
代码如下：

#include <stdio.h>
#define N 10
int binary_search(int [], int, int);

int main()
{
	int a[] = {1,2,3,4,6,8,9,10,13,15};
	int index, num; // 查找的结果，待查找的数 
	printf("请输入要查找的数字：");
	scanf("%d", &num);
	
	index = binary_search(a, N, num);
	
	if (index >= 0) 
		printf("找到了，是第%d个数", index+1);
	else
		printf("未找到!");
	return 0;
}
int binary_search(int a[], int n, int num)
{
	int low, high, mid, t; // low为下界，high为上界，middle为中间位置数 
	low = 0; high = n - 1;
	while(low <= high) // 当下界小于上界时
	{
		mid = (low+high)/2;
		if (num == a[mid]) // 找到了 
		 	return mid;
		else if (num < a[mid])
			high = mid - 1;
		else 
			low = mid + 1;
	}
	return -1;
}