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

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

Problem Description

Input

Output

Example Input

6
33 6 22 9 44 5

Example Output

5 6 9 22 33 44

Code realization

#include <stdio.h>
#include <stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
}LNode;
int num1 = 0,num2 = 0;
LNode *input(int n)
{
LNode *head, *tail, *p;
head = (LNode*)malloc(sizeof(LNode));
tail = head;
for(int i=0;i<n;i++)
{
p = (LNode*)malloc(sizeof(LNode));
scanf("%d",&p->data);
tail->next = p;
tail = p;
tail->next = NULL;
}
return head;
}
void order(LNode *head)
{
LNode *p, *q;
int m;
p = head->next;
while(p)
{
q = p->next;
while(q)
{
if(q->data < p->data)
{
m= q->data;
q->data = p->data;
p->data = m;
}
q = q->next;
}
p = p->next;
}
}
void output(LNode *head)
{
LNode *p;
p = head->next;
while(p)
{
printf("%d",p->data);
p = p->next;
if(p)
printf(" ");
else
printf("\n");
}
}

int main()
{
LNode *head;
int n;
scanf("%d",&n);
head = input(n);
order(head);
output(head);
return 0;
}