2022-04-22 归并排序（自底向上和自顶向下）

自底向上：

#include<bits/stdc++.h>
using namespace std;

void disp(int a[], int n) {
	for (int i = 0; i < n; i++) {
		cout << a[i] << " ";
	}
	cout << endl;
}

void Merge(int a[], int low, int mid, int high) 
//将a[low...mid]和a[mid+1...high]两个相邻的有序子序列归并为一个有序子序列a[low...high]
{
	int* temp = new int[high - low + 1];
	int i = low, j = mid + 1, k = 0;
	while (i <= mid && j <= high) {//扫描两个表按序放入temp中
		if (a[i] <= a[j]) {
			temp[k] = a[i];
			i++; k++;
		}
		else {
			temp[k] = a[j];
			j++; k++;
		}
	}
	while (i <= mid) {//剩下的表余下部分放入temp中
		temp[k] = a[i];
		i++; k++;
	}
	while (j <= high) {
		temp[k] = a[j];
		j++; k++;
	}
	for (k = 0, i = low; i <= high; k++, i++) {//将temp复制回a中
		a[i] = temp[k];
	}
	delete[] temp;
}

void MergePass(int a[], int length, int n) 
//一趟二路归并排序
{
	int i;
	for (i = 0; i + 2 * length - 1 < n; i = i + 2 * length)//归并length长的两个相邻子表
		Merge(a, i, i + length - 1, i + 2 * length - 1);
	if (i + length - 1 < n)//余下两个子表，后者长度小于length
		Merge(a, i, i + length - 1, n - 1);//归并这两个子表
}

void MergeSort(int a[], int n) 
//二路归并算法
{
	int length;
	for (length = 1; length < n; length = 2 * length)
		MergePass(a, length, n);
}


int main() {
	int n = 10;
	int a[] = { 7,5,2,9,8,3,0,4,6,1 };
	cout << "排序前序列：";
	disp(a, n);
	MergeSort(a, n);
	cout << "排序后序列：";
	disp(a, n);
}

自顶向下：

#include<bits/stdc++.h>
using namespace std;

void disp(int a[], int n) {
	for (int i = 0; i < n; i++) {
		cout << a[i] << " ";
	}
	cout << endl;
}

void Merge(int a[], int low, int mid, int high) {
	int* temp = new int[high - low + 1];
	int i = low, j = mid + 1, k = 0;
	while (i <= mid && j <= high) {
		if (a[i] <= a[j]) {
			temp[k] = a[i];
			i++; k++;
		}
		else {
			temp[k] = a[j];
			j++; k++;
		}
	}
	while (i <= mid) {
		temp[k] = a[i];
		i++; k++;
	}
	while (j <= high) {
		temp[k] = a[j];
		j++; k++;
	}
	for (k = 0, i = low; i <= high; k++, i++) {
		a[i] = temp[k];
	}
	delete[] temp;
}

void MergeSort(int a[], int low, int high) {
	int mid;
	if (low < high) {
		mid = (low + high) >> 1;
		MergeSort(a, low, mid);
		MergeSort(a, mid + 1, high);
		Merge(a, low, mid, high);
	}
}
int main() {
	int n = 10;
	int a[] = { 7,5,2,9,8,3,0,4,6,1 };
	cout << "排序前序列：";
	disp(a, n);
	MergeSort(a, 0, n - 1);
	cout << "排序后序列：";
	disp(a, n);
}