链表的顺序插入

#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
	int data;
	struct node *next;
}node;
node *creat()
{
	node *head=(node*)malloc(sizeof(node));
	head->next=NULL;
	return head;
}
node *jianli(node *head)
{
	node *p,*s;
	p=head;
	int x;
	scanf("%d",&x);
	while(x)
	{
		s=(node*)malloc(sizeof(node));
		scanf("%d",&s->data);
		s->next=head->next;
		head->next=s;
		p=s;
		x--;
	}
	return p;
}
void print(node *head)
{
	node *p;
	p=head;
	while(p->next)
	{
		printf("%d ",p->next->data);
		p=p->next;
	}
}
node *paixu(node *head)
{
	int i,count=0,num;
	node *p,*q,*t;
	p=head;
	while(p->next)
	{
		count++;
		p=p->next;
	}
	for(i=0;i<count-1;i++)
	{
		num=count-i-1;
		q=head->next;
		p=q->next;
		t=head;
		while(num--)
		{
			if(q->data>p->data)
			{
				q->next=p->next;
				p->next=q;
				t->next=p;
			}
			t=t->next;
			q=t->next;
			p=q->next;
		}
	}
	return head;
}
void insert(node *head,int x)
{
	node *p,*s;
	p=head;
	while(p->next&&p->next->data<x)
	{
		p=p->next;
	}
	s=(node*)malloc(sizeof(node));
	s->data=x;;
	s->next=p->next;
	p->next=s;
	print(head);
}
int main()
{
	node *head=creat();
	jianli(head);
	paixu(head);
	int x;
	scanf("%d",&x);
	insert(head,x);
}