数据结构实验之链表六:有序链表的建立
Time Limit: 1000MS
Memory Limit: 65536KB
Problem Description
输入N个无序的整数,建立一个有序链表,链表中的结点按照数值非降序排列,输出该有序链表。
Input
第一行输入整数个数N;
第二行输入N个无序的整数。
第二行输入N个无序的整数。
Output
依次输出有序链表的结点值。
Example Input
6 33 6 22 9 44 5
Example Output
5 6 9 22 33 44
Hint
#include
#include
struct node
{
int data;
struct node*next;
};
struct node*creat(int n)
{
int i;
struct node *head, *tail, *p;
head = (struct node*)malloc(sizeof(struct node));
head->next = NULL;
tail = head;
for(i = 1; i <= n; i++)
{
p = (struct node*)malloc(sizeof(struct node));
scanf("%d",&p->data);
p->next = NULL;
tail->next = p;
tail = p;
}
return (head);
};
struct node*sort(struct node*head) //比较data的大小,进行交换
{
int t;
struct node*p, *q;
p = head->next;
while(p)
{
q = p->next;
while(q)
{
if(p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
q = q->next;
}
p = p->next;
}
return (head);
}
void display(struct node *head)
{
struct node *p;
p = head->next;
while(p->next!=NULL)
{
printf("%d ",p->data);
p = p->next;
}
printf("%d\n",p->data);
}
int main()
{
int n;
struct node *head;
scanf("%d",&n);
head = creat(n);
sort(head);
display(head);
return 0;
}