数据结构与算法（九）—— 归并排序

分治思想，递归实现

public class Demo {

	public static void main(String[] args) {
		int[] a = { 6, 0, 5, 4, 7, 2, 1 };
		print(a);
		mergeSort(a);
		print(a);
	}

	// 归并排序
	static void mergeSort(int[] a) {
		mergeSort0(a, 0, a.length - 1);
	}

	static void mergeSort0(int[] a, int l, int r) {
		// 终止条件
		if (l >= r) {
			return;
		}
		// 计算中点
		int m = l + (r - l) / 2;
		mergeSort0(a, l, m);
		mergeSort0(a, m + 1, r);
		// 合并
		merge(a, l, m, r);// 哨兵
		// merge0(a, l, m, r);
	}

	// 合并
	static void merge(int[] a, int l, int m, int r) {
		int[] temLeft = new int[m - l + 2];
		int[] temRight = new int[r - m + 1];
		for (int i = 0; i <= m - l; i++) {
			temLeft[i] = a[l + i];
		}
		for (int i = 0; i < r - m; i++) {
			temRight[i] = a[m + 1 + i];
		}
		temLeft[temLeft.length - 1] = Integer.MAX_VALUE;
		temRight[temRight.length - 1] = Integer.MAX_VALUE;

		int i = 0;
		int j = 0;
		int k = l;
		while (k <= r) {
			if (temLeft[i] <= temRight[j]) {
				a[k++] = temLeft[i++];
			} else {
				a[k++] = temRight[j++];
			}
		}
	}

	// 合并
	static void merge0(int[] a, int l, int m, int r) {
		int i = l;
		int j = m + 1;
		int[] tmp = new int[r - l + 1];
		int k = 0;
		while (i <= m && j <= r) {
			if (a[i] <= a[j]) {
				tmp[k++] = a[i++];
			} else {
				tmp[k++] = a[j++];
			}
		}
		// 剩余节点
		int start = i;
		int end = m;
		if (j <= r) {
			start = j;
			end = r;
		}
		while (start <= end) {
			tmp[k++] = a[start++];
		}
		// 将tmp中的数据拷贝到[l~r]中
		for (i = 0; i < tmp.length; ++i) {
			a[l + i] = tmp[i];
		}
	}

	static void print(int[] a) {
		StringBuilder s = new StringBuilder();
		for (int i : a) {
			if (s.length() == 0) {
				s.append(i);
			} else {
				s.append(",").append(i);
			}
		}
		System.err.println(s.toString());
	}
}