单链表的递增排序

voie sort(LinkList &L)
{
    LNode *p = L->next;
    LNode *pre;
    LNode *r = p ->next;
    p->next =NULL;
    p = r; 
    while(p!=NULL){
            r = p->next;
            pre = L;
            while(pre->next!=NULL&&pre->next->data<p->data)
            pre = pre->next;
            p->next = pre->next;
            pre->next = p;
            p = r;
        }
    }