插值查找算法

 

#include <stdio.h>
int Bin_Search(int *a,int key,int n)
{
	int low,high,mid;
	low = 0;
	high = n - 1;
	while(low <= high)
	{
		mid = low + (high - low) * (key - a[low]) / (a[high] - a[low]); //此处于二分查找不同,套用插值公式
		if(a[mid] > key)			//如果key比插值小,把高位调整为插值下标的下一位			
			high = mid - 1;							
		else if(a[mid] < key)
			low = mid + 1;
		else
			return mid;
	}
	return -1;
}
int main()
{
	int a[] = {1,5,17,25,33,38,46,55,69,75,99};
	int key;
	int len = sizeof(a) / sizeof(*a);
	printf("请输入要查找的值:\n");
	scanf("%d",&key);
	int pos = Bin_Search(a,key,len);
	if(pos != -1)
		printf("在数组的第%d个位置找到:%d\n",pos + 1,key);
	else
		printf("未在数组中找到元素:%d\n",key);
	return 0;
}