写正确函数需要注意的地方：链表的及时终止冒泡排序

Node* sort(Node* phead)
{
	if (NULL==phead || NULL==phead->pNext)
	{
		return phead;
	}

	Node* ptemp=phead;
	Node* plastchangepoint=NULL;//标记上一次
	while (plastchangepoint!=phead->pNext)
	{
		bool changed=false;
		for (ptemp=phead;ptemp->pNext->pNext!=plastchangepoint;ptemp=ptemp->pNext)
		{
			if (ptemp->value>ptemp->pNext->value)
			{
				int t=ptemp->value;
				ptemp->value=ptemp->pNext->value;
				ptemp->pNext->value=t;
				changed=true;
			}
		}
		if (!changed)
		{
			break;
		}
		plastchangepoint=ptemp->pNext;
	}
	return phead;
}