各种排序算法的实现-5（表插入排序-2)

最新推荐文章于 2022-12-15 22:48:31 发布

置顶 ACE777999

最新推荐文章于 2022-12-15 22:48:31 发布

阅读量1.2k

点赞数

分类专栏： C++ MFC win32 界面编程 linux 网络编程

本文链接：https://blog.csdn.net/reader777999/article/details/17645151

版权

C++ 同时被 3 个专栏收录

33 篇文章 0 订阅

订阅专栏

MFC

24 篇文章 0 订阅

订阅专栏

win32

24 篇文章 0 订阅

订阅专栏

主要实现 表从小到大 按顺序整理：

#define SIZE 8

typedef struct
{
   int data;
   int next;
}s_node;

typedef struct
{
	s_node r[SIZE + 1];
}list_type;

void TB_sort(list_type & list)
{
	list.r[0].next = 1;
	list.r[1].next = 0;	//初始状态

	int p, q;
	for (int i = 2; i <= SIZE; i++)
	{
		p = list.r[0].next;
		q = 0;
		while (p > 0 && list.r[p].data <= list.r[i].data)
		{
			q = p;
			p = list.r[p].next;
		}
		list.r[q].next = i;
		list.r[i].next = p;
	}
}



void arrange(list_type & list)
{
	int  p = list.r[0].next;
	int temp;
	for (int i = 1; i<= SIZE; i++)
	{
		while (p < i) p = list.r[p].next;		//找到没有排好序的 第一个出来
		temp = list.r[p].next;
		if (p != i)
		{
			std::swap(list.r[p], list.r[i]);
			list.r[i].next = p;
		}
		p = temp;
	}
}

int main(int argc, char* argv[])
{
	s_node  node[SIZE + 1];
	node[0].data = 0;//这个节点用作哨兵节点

	node[1].data = 23;
	node[2].data = 324;
	node[3].data = 23;
	node[4].data = 333;
	node[5].data = 98;
	node[6].data = -1;
	node[7].data = 45;
	node[8].data = -345;

	list_type list;
	memcpy(list.r, node, sizeof(s_node) * (SIZE + 1));
	TB_sort(list);
	
	int   temp = list.r[0].next;

	for (int i = 1; i<=SIZE; i++ )
	{
		printf("%d ", list.r[temp].data);
		temp = list.r[temp].next;
	}

	arrange(list);
	
	printf("\n");

	for (i = 0; i<SIZE; i++)
	{
		printf("%d  ", list.r[i + 1]);
	}
	system("pause");
	return 0;
}