单链表的冒泡排序！！求解答！！

{
int value;
Node* next;
};void Sort(Node* head)
{
Node* tail = NULL; while(tail != head->next)
{
Node* pre = head;
Node* cur = pre->next;
while(cur != tail && cur->next != tail)
{
if( cur->value > cur->next->value )
{
//交换当前节点和后一个节点
pre->next = cur->next;
cur->next = cur->next->next;
pre->next->next = cur;
}
pre = pre->next;
cur = pre->next;
} tail = cur;
}
}void main()
{
Node* head = new Node();
Node* cur = head; //使用带表头的链表
int n = 10;
//初始化链表数据
for( int i = n; i >0; i-- )
{
Node* node = new Node();
node->value = i;
cur->next = node;
cur = node;
} //排序 Sort(head);
}