12. Single-linked list sorting

12. Single-linked list sorting

Ideas:

See basic function 13://bubble sort list, the practice is "Civet cat for Prince", that is, only the value of the Exchange node, the structure of the list does not change.

void Sortlist (node*& Head);

List sorting//sorting method is not to destroy the structure, there is "Civet cat for Prince" meaning, only the exchange of value, do not destroy the list structure void Sortlist (node*& head) {    int count=numofnodes (head) ;    if (count==0| | Count==1)    {        return;    }    Bubble sort    bool Exchange; for    (int i=2;i<=count;i++)    {        exchange=false; for        (int j=count;j>=i;j--)        {            node* P1=locatenodei (head,j);              node* P2=locatenodei (head,j-1);             if (p1->value<p2->value)            {            exchange=true;              Swap (p1->value,p2->value);         }         }         if (!exchange) break       ;    }}

　　

12. Single-linked list sorting