#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LinkedList{
int data;
struct LinkedList *next;
}LinkedList,*List;
int a[6]={3,2,5,4,1,6};
int n=6;
void build(List &L){
L=(List)malloc(sizeof(LinkedList));
LinkedList *s;
LinkedList *r=L;
for(int i=0;i<n;i++){
s=(LinkedList *)malloc(sizeof(LinkedList));
s->data=a[i];
r->next=s;
r=r->next;
}
r->next=NULL;
}
void show(List &L){
LinkedList *s=L->next;
while(s){
printf("%d ",s->data);
s=s->next;
}
}
void sort(List &L){
LinkedList *p=L->next;
LinkedList *r=p->next;
p->next=NULL;
LinkedList *f;
p=r;
while(p){
f=L;
r=p->next;
while(f->next!=NULL&&f->next->data<p->data){//f->next==NULL说明当前的f已经是最后一个节点了
//直接从头结点开始判断
//f指向的肯定就是条件之内链表中当前最大的节点
f=f->next;
}
//当前的f就是指向最后一个小于p->data的节点
p->next=f->next;
f->next=p;
p=r;
}
}
int main(){
List L;
build(L);
show(L);
printf("\n");
sort(L);
show(L);
return 0;
}