链表排序

void sort(ListNode *head){ListNode *p =NULL ;ListNode *font_min = NULL ;ListNode *min = NULL  ;ListNode *newhead = NULL ,*newTail = NULL ; while(head){ p = head;min = head ; for(;p->next != NULL ; p =p->next){if(min->n > p->next->n){min = p->next ; font_min = p ; }}if(newhead == NULL){newhead = min ;newTail =  min ;}else{newTail->next = min ; newTail = min ;    }    if(min == head)    {    head = head->next ;    }    elsefont_min->next = min->next ;}if(newhead != NULL)newTail->next = NULL ;while(newhead){printf("%d ",newhead->n );newhead = newhead->next ; }}