链表的冒泡排序

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define LEN sizeof(struct list)
struct list
{
	int data;
	struct list *next;
};
int n;
struct list*creat(int n)
{
	int i;
	struct list *head;
	struct list *p1,*p2;
	p1=p2=(struct list*)malloc(LEN);
	scanf("%d",&p1->data);
	head=NULL;
	for(i=1;i<=n;i++)
	{
		if(i==1)
			head=p1;
		else
			p2->next=p1;
		p2=p1;
		p1=(struct list*)malloc(LEN);
		if(i!=n)
		scanf("%d",&p1->data);
	}
	p2->next=NULL;
	return(head);
}
void print(struct list*head)
{
	struct list*p;
	p=head;
	if(head!=NULL)
		do
		{
			printf("%d\n",p->data);
			p=p->next;
		}while(p!=NULL);
}
 struct list* maopao(struct list*head)
{
	struct list*p,*q;
	q=head;
	int m;
	while(q!=NULL)
	{
		p=head;
		while(p!=NULL)
		{
			if(p->next!=NULL)
			{
				if(p->data>p->next->data)
				{
					m=p->data;
				    p->data=p->next->data;
				    p->next->data=m;
				}	
			}
			else
				break;
			p=p->next;
		}
		q=q->next;
	}
	return head;
}
int main()
{
	struct list*head;
	head=creat(5);
	head=maopao(head);
	print(head);
	printf("\n");
	return 0;
}