有序链表的建立（用冒泡排序对连表排序）

数据结构实验之链表六：有序链表的建立

Time Limit: 1000MS Memory limit: 65536K

题目描述

输入

输出

示例输入

6
33 6 22 9 44 5

示例输出

5 6 9 22 33 44

提示

#include<stdio.h>
#include<stdlib.h>
struct vode
{
int date;
struct vode *next;
};
int main()
{
struct vode *head,*tail,*p,*q;
head=(struct vode *)malloc(sizeof(struct vode ));
head->next=NULL;
tail=head;
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
p=(struct vode *)malloc(sizeof(struct vode ));
p->next=NULL;
scanf("%d",&p->date);
tail->next=p;
tail=p;
}
int k=0;
while(k=!k)
{
p=head->next;
q=p->next;
while(q)
{
if(p->date>q->date)
{
int t;
t=p->date;
p->date=q->date;
q->date=t;
k=0;
}
else
{
p=p->next;
q=q->next;
}
}
}
p=head->next;
int s=0;
while(p)
{
if(s==0)
{
printf("%d",p->date);
s=1;
}
else printf(" %d",p->date);
p=p->next;
}
return 0;
}