《C语言》双向链表的增、删、查、改、销毁、快速排序

Main.c

#include "DoubleList.h"
#include <time.h>



void main()
{
   

/*******************头部插入*******************/
#if 0
	DoubleList List = {
   0};

	for (int i = 0; i < 10; i++)
	{
   
		PushHead(&List, i);
	}

	Show(List);
	ShowRev(List);
#endif 

	/*******************尾部插入*******************/
#if 0
	DoubleList List = {
    0 };

	for (int i = 0; i < 10; i++)
	{
   
		PushBack(&List, i);
	}

	Show(List);
	ShowRev(List);
#endif 


	/*******************正向查找节点*******************/
#if 0
	DoubleList List = {
    0 };

	for (int i = 0; i < 10; i++)
	{
   
		PushBack(&List, i);
	}

	Show(List);
	ShowRev(List);

	Node* P_Res[10] = {
    0 };

	for (int i = 0; i < 10; i++)
	{
   
		if (NULL != FindNode(List, i))
		{
   
			P_Res[i] = FindNode(List, i);
		}
	}
	for (int i = 0; i < 10; i++)
	{
   
		NULL != P_Res[i] ? printf("%d\n", P_Res[i]->Data):0;
	}

#endif 


	/*******************反向查找节点*******************/
#if 0
	DoubleList List = {
    0 };

	for (int i = 0; i < 10; i++)
	{
   
		PushBack(&List, i);
	}

	Show(List);
	ShowRev(List);

	Node* P_Res[10] = {
    0 };

	for (int i = 0; i < 10; i++)
	{
   
		if (NULL != FindNode(List, i))
		{
   
			P_Res[i] = FindNodeRev(List, i);
		}
	}
	for (int i = 0; i < 10; i++)
	{
   
		NULL != P_Res[i] ? printf("%d\n", P_Res[i]->Data) : 0;
	}

#endif 


	/*******************指定位置插入节点*******************/
#if 0
	DoubleList List = {
    0 };