链表-使元素递增有序

/*有一个带头结点的单链表L，设计一个算法使其元素递增有序*/
#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct LNode
{
	ElemType data;
	struct LNode *next;
}LNode,*LinkList;

LinkList TailCreateList(LinkList &L)
{
	L = (LinkList)malloc(sizeof(LNode));
	ElemType x;
	LNode *r = L;
	scanf("%d",&x);
	while(x!=9999)
	{
		LNode *s = (LNode*)malloc(sizeof(LNode));
		s->data = x;
		r->next = s;
		r = s;
		scanf("%d",&x);
	}
	r->next = NULL;
	return L;
}

LinkList increList(LinkList &L)
{
	LNode *p = L->next;
	LNode *pre;
	LNode *r = p->next;
	p->next = NULL;
	p = r;
	while(p!=NULL)
	{
		r = p->next;
		pre = L;
		while(pre->next!=NULL && pre->next->data<p->data)
			pre = pre->next;
		p->next = pre->next;
		pre->next = p;
		p = r;
	}
	return L;
}

bool printList(LinkList L)
{
	LNode *p = L->next;
	while(p!=NULL)
	{
		printf("%d ",p->data);
		p = p->next;
	}
	printf("\n");
	return true;
}

void main()
{
	LinkList L;
	TailCreateList(L);
	printList(L);
	increList(L);
	printList(L);
}