Void paixu (Node * & amp; L)
{
Node * temp;
int i;
int j;
Node * p;
Node * p1;
If (temp1==0) return;

For (I=0; I & lt; Temp1-1; I++)
{

For (j=0; J & lt; Temp1 - I - 1; J++)
{
P=L;
P1=L - & gt; Next;
If (p - & gt; Number & gt; P1 - & gt; Number)
{
Temp=p;
P=p;
P1=temp;
Temp=temp - & gt; Next;
}
L=L - & gt; Next;
}
}
}

When I this list only two sets of data when it is a good sort of, is what can't do any one more row?

CodePudding user response:

Singly linked list data structure on data sort http://bbs.csdn.net/topics/392201633