#include<stdio.h>
#include<stdlib.h>
/*
* 有一个带头结点的单链表L,设计一个算法使其元素递增有序
*/
typedef struct LNode {
int data;
struct LNode* next;
}LNode,*LinkList;
LinkList CreatList(LinkList &L)
{
int x;
LNode* s;
L = (LinkList)malloc(sizeof(LNode));
LNode* r = L;
scanf("%d", &x);
while (x != -1)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LinkList BubbleList(LinkList& L) //冒泡排序
{
LNode* pre = L;
LNode* p = L->next;
LNode* ter=NULL;
while (p!=ter)
{
while (p->next != ter)
{
if (p->data > p->next->data)
{
LNode* tmp = p->next;
p->next = tmp->next;
tmp->next = p;
pre->next = tmp;
pre = tmp;
}
else
{
pre = p;
p = p->next;
}
}
ter = p;
pre = L;
p = L->next;
}
return L;
}
void PrintList(LinkList L)
{
L = L->next;
while (L)
{
printf("%4d", L->data);
L = L->next;
}
}
int main()
{
LinkList L;
CreatList(L);
BubbleList(L);
PrintList(L);
return 0;
}