【数据结构】---插值查找

1、插值查找是在折半查找的基础上进行优化，将mid的值修改为

    将查找关键字于查找表中的最大最小关键字对比后进行查找。

    时间复杂度为O(log n)

2、插值查找实现算法

#include <stdio.h>
#define MAXSIZE 100

typedef int KeyType;
typedef char InfoType[10];
typedef struct
{
	KeyType Key;
	InfoType data;
}NodeType;
typedef NodeType SeqList[MAXSIZE];

int Search(SeqList R, int n, KeyType k)
{
	int low, high, mid;
	low = 1;
	high = n;
	while (low <= high)
	{
		mid = low + (high - low)*(k - R[low].Key) / (R[high].Key - R[low].Key);//插值算法核心
		if (k < R[mid].Key)
			high = mid - 1;
		else if (k > R[mid].Key)
			low = mid + 1;
		else
			return mid;
	}
	return 0;
}

int main()
{
	SeqList R;
	int n = 10, i;
	KeyType k;
	printf("输入序列内容(十个不同的数字):");
	for (i = 0; i<10; i++)
	{
		scanf_s("%d", &R[i].Key);
	}
	printf("序列为:");
	for (i = 0; i<n; i++)
	{
		printf("%d,", R[i].Key);
	}
	printf("\n请输入需要查找的关键字为:");
	scanf_s("%d", &k);
	printf("需要搜索的关键字为%d", k);
	if ((i = Search(R, n, k)) != -1)
	{
		printf("\n%d在序列的第%d个位置\n", k, i+1);
	}
}