[ java ] JavaFestival13 - Question6 - 합병 - 두개배열 병합정렬 > java

import java.util.Arrays;

public class Question6 {

    public static void main(String[] args) {

        int[] A = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 };

        int[] B = { 2, 4, 5, 8, 10, 12, 14, 16, 18, 20 };

        int[] C = new int[A.length + B.length];

        int[] Merge = mergeArray(A, B);

        System.out.print("Merge : "+Arrays.toString(Merge));

    }

    public static int[] mergeArray(int[] a, int[] b) {

        int pa = 0;

        int pb = 0;

        int pc = 0;

        int na = a.length;

        int nb = b.length;

        int[] c = new int[a.length + b.length];

        while (pa < na && pb < nb) { // 작은 값

            c[pc++] = (a[pa] <= b[pb]) ? a[pa++] : b[pb++];

        }

        while (pa < na) { // a 요소 복사

            c[pc++] = a[pa++];

        }

        while (pb < nb) {

            c[pc++] = b[pb++];

        }

        return c;

    }

}

Merge : [1, 2, 3, 4, 5, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]