/*
11.已知一个(head)单链表la,其中la={a1,a2,…an},
试设计一个算法将其中从小到大进行排序 ,再输出
*/
# include <iostream>
# include <stdlib.h>
# include <stdio.h>
using namespace std;
typedef struct Node
{
int elem;
struct Node* next;
}*linklist;
void inlinklist(linklist &l, int n)
{
l = (linklist) malloc (sizeof(Node));
l->next = NULL;
linklist p, end;
end = l;
printf("请输入链表中的元素:\n");
for(int i = 0; i<n; i++)
{
p = (linklist) malloc (sizeof(Node));
scanf("%d", &p->elem);
end->next = p;
p->next = NULL;
end = p;
}
}
void outlinklist(linklist l)
{
printf("链表中的元素为:\n");
linklist p;
p = l->next;
while(p != NULL)
{
printf("%d ", p->elem);
p = p->next;
}
printf("\n");
}
void swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void sortlinklist(linklist &l)
{
linklist p, s;
s = p = l->next;
while(s)//表示前边节点i
{
p = s;
while(p)//表示后边节点i+1
{
if(s->elem > p->elem)
swap(&s->elem, &p->elem);
p = p->next;
}
s = s->next;
}
}
int main()
{
linklist l;
int n;
printf("请输入链表的元素个数:\n");
scanf("%d", &n);
inlinklist(l, n);
sortlinklist(l);
outlinklist(l);
return 0;
}