插值查找——C语言描述

最新推荐文章于 2024-10-01 20:11:33 发布

Meditatorss

最新推荐文章于 2024-10-01 20:11:33 发布

阅读量87

点赞数

分类专栏： c语言学习算法文章标签： c语言开发语言

本文链接：https://blog.csdn.net/m0_59469991/article/details/129469281

版权

c语言学习同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

算法

12 篇文章 0 订阅

订阅专栏

文章介绍了C语言中插值查找算法的实现，该算法基于线性插值法改进了二分查找。在数值分布均匀的情况下，插值查找能提高效率。文章提供了算法的详细代码，并设计了多个测试用例以验证其正确性，包括正常情况、边界情况和不存在目标值的情况。

摘要由CSDN通过智能技术生成

插值查找——C语言描述

0 测试用例框架

https://blog.csdn.net/m0_59469991/article/details/127137119?csdn_share_tail=%7B%22type%22%3A%22blog%22%2C%22rType%22%3A%22article%22%2C%22rId%22%3A%22127137119%22%2C%22source%22%3A%22m0_59469991%22%7D

1 定义

使用线性插值法查找，使用二分查找的代码，中间的Mid 改为 Low + ((High – Low) / (Arr[High] – Arr[Low])) * (SearchValue – Arr[Low])；

注意：

① 如果只有一个元素的情况要单独列出来，为了避免插值参数的分母为0;

② 时间复杂度还是为logn，对于要的值均匀分布的情况，采用插值查找效率高.

2 代码

/*InterpolationSearch*/
int InterpolationSearch(int *Arr, int Num, int SearchValue) {
	int Low = 0;
	int High = Num - 1;
	int Mid;

	if ((Arr == NULL) || (Num <= 0) || (SearchValue < Arr[Low]) || (SearchValue > Arr[High])) {
		return -1;
	}

	if (Num == 1) {
		return 0;
	}

	while (Low < High) {
		Mid = Low + (int)(((SearchValue - Arr[Low]) / (Arr[High] - Arr[Low])) * (High - Low));
		if (SearchValue < Arr[Mid]) {
			High = Mid - 1;
		} else if (SearchValue > Arr[Mid]) {
			Low = Mid + 1;
		} else {
			return Mid;
		}
	}

	return -1;
}

4 测试用例

/*InterpolationSearch*/
void TesInterpolationSearchSearch(void) {
	/*Test01: Normal*/
	int Arr01[] = { 0, 1, 2, 3, 4, 5 };
	int SearchValue01 = 2;
	int Res01 = 0;
	int CmpRes01 = 2;
	int Num01 = 6;

	/*Test02: Bounary*/
	int Arr02[] = { 0, 1, 2, 3, 4, 5 };
	int SearchValue02 = 0;
	int Res02 = 0;
	int CmpRes02 = 0;
	int Num02 = 6;

	/*Test03: Bounary*/
	int Arr03[] = { 0, 1, 2, 3, 4, 5 };
	int SearchValue03 = 5;
	int Res03 = 0;
	int CmpRes03 = 5;
	int Num03 = 6;

	/*Test04: Don't exit*/
	int Arr04[] = { 0, 1, 2, 3, 4, 5 };
	int SearchValue04 = 7;
	int Res04 = 0;
	int CmpRes04 = -1;
	int Num04 = 6;

	/*Test05: Only a Mem and exit*/
	int Arr05[] = { 0 };
	int SearchValue05 = 0;
	int Res05 = 0;
	int CmpRes05 = 0;
	int Num05 = 1;

	printf("-------Test start----------\n");
	InitNum();

	/*Test01*/
	printf("\n-------Test 01----------\n");
	Res01 = InterpolationSearch(Arr01, Num01, SearchValue01);
	TestCmpRes(CmpRes01, Res01);

	/*Test02*/
	printf("\n-------Test 02----------\n");
	Res02 = InterpolationSearch(Arr02, Num02, SearchValue02);
	TestCmpRes(CmpRes02, Res02);

	/*Test03*/
	printf("\n-------Test 03----------\n");
	Res03 = InterpolationSearch(Arr03, Num03, SearchValue03);
	TestCmpRes(CmpRes03, Res03);

	/*Test04*/
	printf("\n-------Test 04----------\n");
	Res04 = InterpolationSearch(Arr04, Num04, SearchValue04);
	TestCmpRes(CmpRes04, Res04);

	/*Test05*/
	printf("\n-------Test 05----------\n");
	Res05 = InterpolationSearch(Arr05, Num05, SearchValue05);
	TestCmpRes(CmpRes05, Res05);

	/*Test Result*/
	printf("\n-------Test result----------\n");
	TestResult();
}

打印结果

-------Test start----------

-------Test 01----------

-------Test 02----------

-------Test 03----------

-------Test 04----------

-------Test 05----------

-------Test result----------

Print test result;

TestNum = 5, PassNum = 5, FaildNum = 0