索引查找算法

最新推荐文章于 2024-07-24 18:52:10 发布

埋没了的承诺

最新推荐文章于 2024-07-24 18:52:10 发布

阅读量644

点赞数

分类专栏：数据结构和算法

本文链接：https://blog.csdn.net/yaoxiaokui/article/details/46884485

版权

数据结构和算法专栏收录该内容

32 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define INDEXTABLE_LEN 3//索引表长度
#define TABLE_LEN 30//主索引表

typedef struct item
{
	int index;//索引值
	int start;//开始位置
	int length;//子表长度
}INDEXITEM;

long stu[TABLE_LEN] = {
	1080101, 1080102, 1080103, 1080104, 1080105, 1080106, 0, 0, 0, 0,
	1080201, 1080202, 1080203, 1080204, 0, 0, 0, 0, 0, 0,
	1080301, 1080302, 1080303, 1080304, 0, 0, 0, 0, 0, 0};

INDEXITEM indextable[INDEXTABLE_LEN] = {
	{10801, 0, 6},
	{10802, 10, 4},
	{10803, 20, 4}
};
//查找数据
int IndexSearch(long key)
{
	int i, index1, start, length;
	index1 = key / 100;
	for (i = 0; i < INDEXTABLE_LEN; i++)
	{
		if (indextable[i].index == index1)
		{
			start = indextable[i].start;//获取数组开始序号
			length = indextable[i].length;
			break;
		}
	}
	if (i >= INDEXTABLE_LEN)
		return -1;
	for (i = start; i < start + length; i++)
	{
		if (stu[i] == key)
			return i;
	}
	return -1;
}
//向主表中插入数据
int InsertNode(long key)
{
	int i, index1, start, length;
	index1 = key / 100;
	for (i = 0; i < INDEXTABLE_LEN; i++)
	{
		if (indextable[i].index == index1)
		{
			start = indextable[i].start;//获取数组开始序号
			length = indextable[i].length;
			break;
		}
	}
	if (i >= INDEXTABLE_LEN)
		return -1;
	
	stu[start + length] = key;
	indextable[i].length++;
	return 0;
}
//主函数
int main()
{
	long key;
	int i, pos;
	printf("原数据\n");
	for (i = 0; i < TABLE_LEN; i++)
	{		
		printf("%ld ", stu[i]);	
		if (stu[i] == 0 && stu[i+1] != 0)
			printf("\n");
	}
	printf("输入要查找的关键字：");
	scanf("%ld", &key);
	pos = IndexSearch(key);

	if (pos > 0)
		printf("查找成功，%ld关键字位于数组的第%d个位置。\n", key, pos+1);
	else
		printf("查找失败。\n");
	printf("输入要插入的关键字:");
	scanf("%ld", &key);
	if (InsertNode(key) == -1)
		printf("插入失败!\n");
	else
	{
		for (i = 0; i < TABLE_LEN; i++)
		{		
			printf("%ld ", stu[i]);	
			if (stu[i] == 0 && stu[i+1] != 0)
				printf("\n");
		}
	}
	getchar();
	getchar();
	return 0;
}