template<typename T>
void Merge(T arrayT[], const int begin, const int mid, const int end)
{
T *tempArray = new T[end - begin + 1];
int iIndex = begin;
int jIndex = mid + 1;
int kIndex = 0;
while (iIndex <= mid && jIndex <= end)
{
if (arrayT[iIndex] < arrayT[jIndex])
{
tempArray[kIndex] = arrayT[iIndex];
++iIndex;
}
else
{
tempArray[kIndex] = arrayT[jIndex];
++jIndex;
}
++kIndex;
}
if (iIndex <= mid)
{
memcpy(tempArray + kIndex, arrayT + iIndex, sizeof(T) * (mid - iIndex + 1));
}
if (jIndex <= end)
{
memcpy(tempArray + kIndex, arrayT + jIndex, sizeof(T) * (end - jIndex + 1));
}
memcpy(arrayT + begin, tempArray, (end - begin + 1) * sizeof(T));
delete []tempArray;
tempArray = nullptr;
}
template<typename T>
void MergeSort(T arrayT[], int begin, int end)
{
if (end <= begin)
return ;
int mid = (end + begin) / 2;
MergeSort(arrayT, begin, mid);
MergeSort(arrayT, mid + 1, end);
Merge(arrayT, begin, mid, end);
}
主要思路:
1. 将两个有序的表合成一个有序的表,选区两个表中较小的放到辅助表中,结束比较之后如果某一个表还有剩余元素就全部复制到辅助表中
2. 使用递归实现