归并排序

package test;

public class MergeSort {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] A = { 1, 3, 5 };
		int[] B = { 2, 4, 7 };
		int[] C = merge(A, B);
		for (int i = 0; i < C.length; i++) {
			System.out.print(C[i] + " ");
		}
		System.out.println();
	}

	public static int[] merge(int[] A, int[] B) {
		int[] C = new int[A.length + B.length];
		int i = 0, j = 0;

		for (; j < A.length && j < B.length; j++) {
			if (A[j] < B[j]) {
				C[i++] = A[j];
				C[i++] = B[j];
			} else {
				C[i++] = B[j];
				C[i++] = A[j];
			}
		}

		while (j < A.length) {
			C[i++] = A[j++];
		}
		while (j < B.length) {
			C[i++] = B[j++];
		}
		return C;
	}
}