Problem Description
Input
第一行输入整数个数N;第二行输入N个无序的整数;处理到文件结束.
Output
依次输出有序链表的结点值。
Sample Input
6
33 6 22 9 44 5
Sample Output
5 6 9 22 33 44
Hint不得使用数组!
#include <stdio.h>
#include<iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
struct node
{
int data;
struct node *next;
};
struct node *creat(int n)
{
struct node *head,*tail,*p;
int i;
head=(struct node *)malloc(sizeof(struct node));
head->next=NULL;
tail=head;
for(i=0;i<n;i++)
{
p=(struct node *)malloc(sizeof(struct node));
scanf("%d",&p->data);
p->next=NULL;
tail->next=p;
tail=p;
}
return head;
};
void sort(struct node *head,int n)
{
struct node *p,*q;
int t;
for(p=head->next;p!=NULL;p=p->next)
{
for(q=p->next;q!=NULL;q=q->next)
{
if(p->data>q->data)
{
t=p->data;
p->data=q->data;
q->data=t;
}
}
}
}
void show(struct node *head)
{
struct node *p;
p=head->next;
while(p!=NULL)
{
if(p->next!=NULL)
printf("%d ",p->data);
else
printf("%d
",p->data);
p=p->next;
}
}
int main()
{
int n;
while(cin>>n)
{
struct node *head;
head=creat(n);
sort(head,n);
show(head);
}
return 0;
}