[传统算法05]归并排序

归并排序算法：
算法原理：
打散元素，一个个比较，比较抽象，这个算法，具体请看例子

例如：有个数组: {6,5,4,3,2,1,9,4}，要求从小到大排序
1.将其打散成为 6,5,4,3,2,1,9,4 ，成为每个独立元素
2.相邻元素比较大小，先合并一次,形成4组数据{5,6} {3,4}{1,2}{4,9}
3.然后相邻组再进行排序合并{3,4,5,6},{1,2,4,9}
4.然后相邻组再进行排序合并{1,2,3,4,4,5,6,9}

上代码

public static void main(String[] args) {
	int[] arrs = { 6, 5, 4, 3, 2, 1, 9, 4 };
	sort(arrs, 0, arrs.length - 1);
	for (int i = 0; i < arrs.length; i++) {
		System.out.println(arrs[i]);
	}
}

private static void sort(int[] arrs, int left, int right) {
	int mid = (left + right) / 2;
	if (right > left) {
		sort(arrs, left, mid);
		sort(arrs, mid + 1, right);
		merge(arrs, left, mid, right);
	}
}

private static void merge(int[] arrs, int left, int mid, int right) {
	int[] temp = new int[arrs.length];
	int p1 = left, p2 = mid + 1, k = left;
	while (p2 <= right && p1 <= mid) {
		if (arrs[p1] <= arrs[p2]) {
			temp[k++] = arrs[p1++];
		} else {
			temp[k++] = arrs[p2++];
		}
	}

	while (p1 <= mid) {
		temp[k++] = arrs[p1++];
	}

	while (p2 < right) {
		temp[k++] = arrs[p2++];
	}

	for (int i = left; i < k; i++) {
		arrs[i] = temp[i];
	}
}