void LinListSort(SLNode *head)
{
SLNode *curr,*pre,*p,*q;
p=head->next;
head->next=NULL;
while (p!=NULL)
{
curr=head->next;
pre=head;
while (curr!=NULL&&curr->data<=p->data)
{
pre=curr;
curr=curr->next;
}
q=p;
p=p->next;
q->next=pre->next;
pre->next=q;
}
}
每次这段代码的时候头晕了,记下来慢慢看。