2121 数据结构实验之链表六：有序链表的建立 【纯插排】

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

Time Limit: 1000MS Memory limit: 65536K

题目描述

输入

输出

示例输入

6
33 6 22 9 44 5

示例输出

5 6 9 22 33 44

提示

#include <stdio.h>

struct n
{
int num;
struct n *next;
};

int main()
{
int sn,t;
n *head = new n;
n *tail,*tmp;

head->next = NULL;
tail = head;

scanf ("%d",&sn);

if (sn != 0)
{
scanf ("%d",&head->num);
t = sn - 1;
while (t--)
{
tmp = new n;
scanf ("%d",&tmp->num);
tmp->next = NULL;
n *p = head;
while (p->next != NULL && p->next->num < tmp->num)
{
p = p->next;
}

if (p == head && tmp->num < head->num)
{
tmp->next = head;
head = tmp;
}else
{
tmp->next = p->next;
p->next = tmp;

}
}

}

tmp = head;
while (tmp != NULL)
{
printf ("%d",tmp->num);

if (tmp->next != NULL)
printf (" ");
else
printf ("\n");
tmp = tmp->next;
}

return 0;
}