查找算法

算法库ALG.h

ifndef _ALGH_
#define MAXL 100
#define MAXI 20     //索引表的最大长度
typedef int KeyType;
typedef char InfoType[10];
typedef struct
{
	KeyType key;                //KeyType为关键字的数据类型
	InfoType data;              //其他数据
} NodeType;
typedef NodeType SeqList[MAXL];     //顺序表类型

typedef struct
{
	KeyType key;            //KeyType为关键字的类型
	int link;               //指向对应块的起始下标
} IdxType;
typedef IdxType IDX[MAXI];  //索引表类型

int SeqSearch(SeqList R, int n, KeyType k)
{
	int i = 0;
	while (i < n && R[i].key != k)  //从表头往后找
		i++;
	if (i >= n)
		return 0;
	else
		return i + 1;
}//顺序查找

int BinSearch(SeqList R, int n, KeyType k,int &num)
{
	int low = 0, high = n - 1, mid;
	while (low <= high)
	{
		mid = (low + high) / 2;
		if (R[mid].key == k)      //查找成功返回
			return mid + 1;
		if (R[mid].key > k)       //继续在R[low..mid-1]中查找
			high = mid - 1;
		else
			low = mid + 1;    //继续在R[mid+1..high]中查找
		num++;
	}
	return 0;
}//二分查找

int IdxSearch(IDX I, int m, SeqList R, int n, KeyType k)
{
	int low = 0, high = m - 1, mid, i;
	int b = n / m;              //b为每块的记录个数
	while (low <= high)       //在索引表中进行二分查找,找到的位置存放在low中
	{
		mid = (low + high) / 2;
		if (I[mid].key >= k)
			high = mid - 1;
		else
			low = mid + 1;
	}
	//应在索引表的high+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;
}//分块查找

#endif // !_ALGH_
#pragma once

main.cpp

#include <stdio.h>
#include"ALG.h"
int main()
{
	int i, n = 56, m = 8, j;
	SeqList R;
	IDX I = { {23,0},{36,8},{98,16},{158,24},{243,32},{492,40},{856,56}};
	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 = 61;//21
	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("未找到%d\n", x);
	return 0;
}