第十四周项目2—验证算法（分块查找算法）

问题及代码

 

/*

copyright （t） 2016，烟台大学计算机学院

*All rights reserved.

*文件名称：1.cpp

*作者：郗传秀*完成日期：2016年12月2日

*版本号：v1.0

*问题描述：认真阅读并验证分块查找算法。请用22,4,23,11,20,2,15,13,30,45,26,34,29,35,26,36,55,98,56, 74,61,90,80,96,127,158,116,114,128,113,115,102,184,211,243,188,187,218,195,210,279,307,492,452,408,361,421,399,856,523,704,703,697,535,534,739(共n=56个数据，每块数据个数s=8)
作为数据表，自行构造索引表，分别对查找61、739、200进行测试。

*输入描述：无

*程序输出：测试结果

*/


#include<stdio.h>
#define MAXL 1000
typedef int KeyType;
typedef int InfoType;
typedef struct
{
	KeyType key;
}NodeType;
typedef NodeType SeqList[MAXL];
typedef struct
{
	KeyType key;
	int link;
}IdxType;
typedef IdxType IDX[MAXL];



int IdxSearch(IDX I,int m,SeqList R,int n,KeyType k)
{
	int low=0,high=m-1,mid,i ;
	int b=n/m;
	while(low<=high)
	{
		mid=(low+high)/2;
		if (I[mid ].key>=k)
			high=mid-1;
		else
			low=mid+1;
	}
	i=I[high+1].link;
	while (i<=I[high+1].link+b-1  && R[i].key!=k) i++;
	if(i<=I[high+1].link+b-1)
		return i+1;
	else
		return 0;


}
int main()
{
	int i,n=25,m=25,j;
	SeqList R;
	IDX I= {{23,0},{45,8},{98,16},{158,24},{243,32},{492,40},{856,48}};
    KeyType a[]= {22,4,23,11,20,2,15,13,30,45,26,34,29,35,26,36,55,98,56,74,61,90,80,96,127,158,116,114,128,113,115,102,184,211,243,188,187,218,195,210,279,307,492,452,408,361,421,399,856,523,704,703,697,535,534,739};
    KeyType x=200;
	for(i=0;i<n;i++)
		R[i].key=a[i];
	j=IdxSearch(I,m,R,n,x);
	if(j!=0)
		printf("%d是第%d个数据\n",x,j);
	else
		printf("未找到此数据");
	return 0;
}


 
 
运行结果