链表知识点（四）【单链表排序（冒泡排序）】

Link* Sort_link(Link * Head)

{

       Link *p;

       int n;

       int temp;

       int i;

       int j;

   

       p = Head;

       n = Calculate_Length(Head);

 

       if(Head== NULL || Head->next == NULL)

       {

              returnHead;

       }

 

 

       for(i=0;i<n-1;i++)

       {

              p = Head;

              for(j=0;j<n-i-1;j++)

              {

            if(p->data> p->next->data)

                     {

                            temp = p->data;

                            p->data =p->next->data;

                p->next->data = temp;

                     }

                     p = p->next;

              }

       }

       returnHead;

}//冒泡排序