链表排序c++ 冒泡怎么用

Question

冒泡排序链表中使用方法希望可以发代码详细点c++语言中 ..........谢谢

Answer 1

 http://blog.csdn.net/bitboss/article/details/51602826

#include<stdio.h>
#include<assert.h>

typedef int DataType;

typedef struct LinkNode
{
    DataType data;
    struct LinkNode* next;
}LinkNode,*pLinkNode;//结点结构体

typedef struct LinkList
{
    LinkNode* pHead;//头结点指针
}LinkList ,*pLinkList;//链表


void BubbleSort (pLinkList pList)
{
    pLinkNode cur = NULL;
    pLinkNode teil = NULL;

    assert(pList);

    cur = pList->pHead ;

    while(cur != teil)
    {
        while(cur->next != teil)
        {
            if(cur->data > cur->next ->data )
            {
                DataType tmp = cur->data ;
                cur->data = cur->next ->data ;
                cur->next ->data = tmp;
            }
            cur = cur->next ;
        }
        teil = cur;
        cur = pList->pHead ;
    }
    return ;
}