SWUST OJ 446: 合并排序

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	private static int[] merge(int[] arr, int[] left, int[] right) {
		int i = 0, l = 0, r = 0;

		// 左右里先找出较小的排入合并
		while (l < left.length && r < right.length) {
			if (left[l] < right[r]) {
				arr[i] = left[l];
				l++;
				i++;
			} else {
				arr[i] = right[r];
				r++;
				i++;
			}
		}

		// 只剩左边
		while (l < left.length) {
			arr[i] = left[l];
			l++;
			i++;
		}

		// 只剩右边
		while (r < right.length) {
			arr[i] = right[r];
			r++;
			i++;
		}

		return arr;
	}

	private static void mergeSort(int[] arr) {
		int len = arr.length;
		int mid = len / 2;

		if (len > 1) {
			// 左右分开递归排序
			int[] left = Arrays.copyOfRange(arr, 0, mid);
			int[] right = Arrays.copyOfRange(arr, mid, len);
			mergeSort(left);
			mergeSort(right);

			merge(arr, left, right);
		}
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = in.nextInt();
		}

		// 排序
		mergeSort(arr);

		for (int i = 0; i < n; i++) {
			System.out.print(arr[i]);
			if ((i + 1) % 10 == 0) {
				System.out.print("\n");
			} else if (i == n - 1) {
				System.out.print("\n");
			} else {
				System.out.print("  ");
			}
		}
	}

}