[데이터 구조] 질서 있 는 배열 통합

public class Merge {

    //      
    public static void mergeSort(int a[], int b[], int c[]) {
        int n = a.length, m = b.length;
        int i, j, k;
        i = j = k = 0;

        while (i < n && j < m) {
            if (a[i] < b[j]) {
                c[k++] = a[i++];
            } else {
                c[k++] = b[j++];
            }

        }
        while (i < n)
            c[k++] = a[i++];
        while (j < m)
            c[k++] = b[j++];
    }

    //        
    public static void printArr(int a[]) {
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + "\t");
        }
    }

    public static void main(String[] args) {
        System.out.println("Hello World!");
        int[] a = new int[] { 1, 2, 5, 6 };
        int[] b = new int[] { 3, 8, 9, 10 };
        int c[] = new int[8];

        mergeSort(a, b, c);
        printArr(c);
    }
}
    ：
1   2   3   5   6   8   9   10

#include <stdio.h>
//     a
void printArr(int a[],int n){
    for (int i = 0; i < n; ++i)
    {
        printf("%d\t",a[i]);
    }
    printf("
");
}
//      
void  mergeArray(int a[],int n,int b[],int m,int c[]){
    int i, j, k;  

    i = j = k = 0;  
    while (i <n && j<m)  
    {  
        if (a[i] < b[j])  
            c[k++] = a[i++];  
        else  
            c[k++] = b[j++];   
    }  

    while (i < n)  
        c[k++] = a[i++];  

    while (j < m)  
        c[k++] = b[j++];  

}
int main(){
   int a[3]={2,3,6};
   int b[2]={1,5};
   int c[5]={};
   mergeArray(a,3,b,2,c);
   printArr(c,5);
}
    ：
yaopans-MacBook-Pro:algorithm yaopan$ ./a.out 
1   2   3   5   6