数据结构

2.8 单链表L递增排序

void sort(LinkNode *&L){
LinkNode *p, *pre, *q;
p=L->next->next;
L->next->next=NULL;

while(p != NULL){
q=p->next;
pre=L;

while(pre->next != NULL && pre->next->data < p->data)
pre=pre->next;
p->next=pre->next;
pre->next=p;
p=q;
}
}
main(){
ElemType a[]={1,3,2,9,0,4,7,6,5,8};
}