void QuickSort(Node* pBeign, Node* pEnd){ if(pBeign != pEnd){ Node* partion = GetPartion(pBeign, pEnd); QuickSort(pBeign,partion); QuickSort(partion->next,pEnd); } }
errorType QuickSort(wordFreq* pBeign, wordFreq* pEnd) { if(pBeign != pEnd) { wordFreq* partion = GetPartion(pBeign,pEnd); QuickSort(pBeign, partion); QuickSort(partion->next,pEnd); } return ERROR_NONE; }