实现单链表的插入排序 无 void sortList(LinkList *L){ LinkList *p,*q,*r; if(L-next) { q = L-next-next; L-next-next = NULL; while(q) { p = L; r = q-next; while(p-next!=NULLp-next-data=q-data) { p = p-next; } q-next = p-next; p-next = q; q = r;
void sortList(LinkList *L) { LinkList *p,*q,*r; if(L->next) { q = L->next->next; L->next->next = NULL; while(q) { p = L; r = q->next; while(p->next!=NULL&&p->next->data<=q->data) { p = p->next; } q->next = p->next; p->next = q; q = r; } } else { cout<<"the original list is sorted!"<<endl; } }