MergeSort(A,low,mid);//对左侧子序列进行递归排序
MergeSort(A,mid+1,high);//对右侧子序列进行递归排序
Merge(A...(A,0,6)
mid=3
MergeSort(A,0,3)//左侧子序列进行递归排序
{
mid=(0+3)/2=1;
MergeSort...MergeSort(A,4,6)//右侧子序列进行递归排序
{
mid=(4+6)/2=5;
MergeSort(A,5,6);
{...mid=(5+6)/2=5;
MergeSort(A,5,5);
MergeSort(A,6,6);
Merge(A,5,5,6);//...[13,27]
}
MergeSort(A,6,6);
Merge(A,4,5,6)//[13,27,76]
}
Merge(A,