#include<stdlib.h>
typedef struct Node{
int e;
struct Node * next;
}Node;
int main()
{
int n;
Node *head,*p,*q;
int i,tem;
while(scanf("%d",&n)!=EOF)
{ head=(Node*)malloc(sizeof(Node));
p=head;
for(i=0;i<n;i++)
{
p->next=(Node *)malloc(sizeof(Node));
p->next->next=NULL;
scanf("%d",&p->next->e);
p=p->next;
}
p->next=NULL;
for(i=0;i<n-1;i++)
{
for(p=head->next;p->next!=NULL;p=p->next)
{
if(p->e>p->next->e)
{
tem=p->e;
p->e=p->next->e;
p->next->e=tem;
}
}
}
p=head->next;
while(p->next!=NULL)
{
printf("%d ",p->e);
p=p->next;
}
printf("%d",p->e);
printf("\n");
p=head->next;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
free(p);
free(head);
}
}
下面这个运行时间比我的小得多,这是为什么呢
#include<stdio.h>
#include<malloc.h>
typedef struct Node
{
int data;
struct Node *next;
}LinkList;
int main()
{
int i,n,a;
while(scanf("%d",&n) != EOF){
LinkList *head,*pre,*p,*newNode;
head = (LinkList*)malloc(sizeof(LinkList));
head->next = NULL;
//输入数据
for(i = 0;i < n;i++){
//创建节点
newNode = (LinkList*)malloc(sizeof(LinkList));
scanf("%d",&newNode->data);
//升序排列
pre = head;
p = head->next;
//找到插入位置
while(p){
if(newNode->data < p->data){
break;
}
pre = p;
p = p->next;
}
//插入新节点
newNode->next = p;
pre->next = newNode;
}
//输出
p = head->next;
printf("%d",p->data);
while(p->next){
p = p->next;
printf(" %d",p->data);
}
printf("\n");
}
return 0;
}