两个有序链表的合并（递归）

题目：两个无序链表的合并先各自排序，然后合并

详细代码请参考：https://github.com/Sangewang/LinkListPrac/blob/master/CreateAndShowLinklist.c

void LinkListBubbleSort(LinkNode *pHead,int len)
{
if(NULL == pHead)
{
return;
}
int i,j=0;
for(i=0;i<len-1;i++)
{
LinkNode *pTemp = pHead;
for(j=0;j<len-i-1;j++)
{
if(pTemp->m_Value > pTemp->p_Next->m_Value)
{
int temp = pTemp->m_Value;
pTemp->m_Value = pTemp->p_Next->m_Value;
pTemp->p_Next->m_Value = temp;
}
pTemp = pTemp->p_Next;
}
}
}
LinkNode * MergeLinkList(LinkNode *pHead1,LinkNode * pHead2)
{
if(NULL==pHead1) return pHead2;
if(NULL==pHead2) return pHead1;
LinkNode * pMergeHead = NULL;
if(pHead1->m_Value < pHead2->m_Value)
{
pMergeHead = pHead1;
pMergeHead->p_Next = MergeLinkList(pHead1->p_Next,pHead2);
}
else
{
pMergeHead = pHead2;
pMergeHead->p_Next = MergeLinkList(pHead1,pHead2->p_Next);
}
return pMergeHead;
}