FRQ Test • 3 min read

public static int[] makeArray(int n) {
    int[] array = new int[n];

    for (int i = 0; i < array.length; i ++) {
        array[i] = i + 1;
    };

    return array;
}


public static int[] reverseArray(int[] list){
    int length = list.length;
    int[] reverse = new int[length];

    int j = 0;

    for (int i = length - 1; i >= 0; i --) {
        reverse[j] = list[i];
        j +=1;
    };

    return reverse;
}

public static String printArray(int[] list) {
    String json = "[";

    for (int i = 0; i < list.length; i ++) {
        json += list[i];

        if (i != list.length - 1) {
            json += ", ";
        };  
    };

    json += "]";

    return json;
}

public static int[] mergeArray(int[] arr1, int[] arr2) {
    int[] result = new int[arr1.length + arr2.length];

    int index = 0;

    for (int i = 0; i < arr1.length; i ++) {
        result[index] = arr1[i];
        index ++;
    };


    for (int i = 0; i < arr2.length; i ++) {
        result[index] = arr2[i];
        index ++;
    };

    return result;
}

int[] initial = makeArray(10);
int[] reverse = reverseArray(initial);
int[] merged = mergeArray(reverse, initial);
printArray(merged);

[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]