模版排序

template<typename T>

struct Node

{

T m_Data;

Node * m_pNext;

};

template<typename T>

bool SelectSort(Node<T> * & pHead)

{

Node<T> * pCurNode = NULL;

Node<T> * pTemp = NULL;

T tTemp;

Node<T> * pMin = NULL;

if (!pHead)

return false;

pCurNode = pHead;

while (pCurNode)

{

pTemp = pCurNode->m_pNext;

pMin = pCurNode;

while (pTemp)

{

if (pTemp->m_Data < pMin->m_Data)

{

pMin = pTemp;

}

pTemp = pTemp->m_pNext;

}

if (pMin != pCurNode)

{

tTemp = pCurNode->m_Data;

pCurNode->m_Data = pMin->m_Data;

pMin->m_Data = tTemp;

}

pCurNode = pCurNode->m_pNext;

}

return true;

}