4,链表和函数指针结合

4,1输出(可以转换输出任意类型的数据)
typedef int Data;//可以改数据类型
typedef void (*PFUNC)(Node*);//函数指针
void transfrom(DuList* list,PFUNC func)//回调函数
{
   
	if (empty(list))
	{
   
		return;
	}
	Node* curNode = list->front->next;
	while (curNode!=list->front)
	{
   
		func(curNode);
		curNode = curNode->next;
	}
}
void print(Node* node)//输出
{
   
	printf("%d ", node->data);
}
transfrom(list, print);//调用
4.2排序(控制升降)
typedef bool (*CMPARE)(Node* a,Node* b);//函数指针
void sort(DuList* list, CMPARE cmp)
{
   
	if (empty(list))
	{
   
		return;
	}
	for (Node* i = list->front->next; i->next!= list->front; i=i->next)
	{
   
		for (Node* k = list->front->next; k->next != list->front; k = k->next)
		{
   
			if (cmp(k,k->next))
			{
   
				Data t = k->data;
				k->data = k->next->data;
				k->next->data = t;
			}
		}
	}
}
bool less(Node* a, Node* b)//降序
{
   
	return a->data < b->data;
}
bool grade(Node* a, Node* b)//升序
{
   
	return a->data > b->data;
}
sort(list,less);//按降序排列