思想:
将两个有序数列合并成一个有序数列我们称之为归并。归并排序就是利用归并思想对数列进行排序。归并排序包括“从上到下”和“从下到上”,这里主要讲从上到下的思想:
(1)分解:将当前区间一分为二,即求分裂点mid=(start+end)/2;
(2)求解:递归的对两个子区间a[start,mid]和a[mid+1,end]进行归并排序。递归的终结条件是子区间长度为1.
(3)合并:将已排序的两个子区间a[start,mid]和a[mid+1,end]归并为一个有序的区间a[low,high]
程序
//(5)归并排序
void merge(int *a, int start, int mid, int end)
{
int *temp = new int[end - start + 1];
int i = start;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= end)//(i < mid && j < end)
{
if (a[i] <= a[j])//(a[i] >= a[j])
temp[k++] = a[i++];
else
temp[k++] = a[j++];
}
while (i <= mid)
temp[k++] = a[i++];
while(j <= end)
temp[k++] = a[j++];
for (i = 0; i< k; ++i)
{