Breaking News: Grepper is joining You.com. Read the official announcement!

merge two sorted arrays using recursively

Lucky Lobster answered on January 18, 2022 Popularity 1/10 Helpfulness 1/10

answer merge two sorted arrays using recursively

merge two sorted arrays using recursively

Comment

public static char[] mergeArrays( char[] A, char[] B) {
    char[] sorted = new char[A.length + B.length];
    mergeArraysHelper(A, B, sorted, 0);
    return sorted;
}

public static void mergeArraysHelper(char[] a, char[] b, char[] sorted, int index) {
    if(a.length == 0) {
        System.arraycopy(b, 0, sorted, index, b.length);
        return;
    }

    if(b.length == 0) {
        System.arraycopy(a, 0, sorted, index, a.length);
        return;
    }

    if(a[0] <= b[0]) {
        sorted[index] = a[0];
        mergeArraysHelper(Arrays.copyOfRange(a, 1, a.length), b, sorted, index + 1);
    } else {
        sorted[index] = b[0];
        mergeArraysHelper(a, Arrays.copyOfRange(b, 1, b.length), sorted, index + 1);
    }
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: stackoverflow.com

Tags: arrays merge using whatever

Link to this answer
Share Copy Link