/Java/Merge sort algorithm in java short answer

Merge sort algorithm in java short answer

public static void mergeSort(int[] a, int n) {
    if (n < 2) {
        return;
    }
    int mid = n / 2;
    int[] l = new int[mid];
    int[] r = new int[n - mid];

    for (int i = 0; i < mid; i++) {
        l[i] = a[i];
    }
    for (int i = mid; i < n; i++) {
        r[i - mid] = a[i];
    }
    mergeSort(l, mid);
    mergeSort(r, n - mid);

    merge(a, l, r, mid, n - mid);
}

Source: baeldung.com

Similar codes

0 vote272 views1 answer
Compare array with himself java
Java
0 vote183 views1 answer
Java program to find the power of a number
Java
4 votes204 views2 answers
How to add to a file in java
Java
0 vote187 views1 answer
Cannot find symbol variable Log
Java
0 vote190 views1 answer
Root tree java
Java
0 vote184 views1 answer
Convert int to double with 2 decimal places java
Java
0 vote214 views1 answer
No Java executable found in current PATH: /bin:/usr/bin:/sbin:/usr/sbin
Java
0 vote224 views1 answer
Void setup
Java
0 vote255 views1 answer
Hash tree in java
Java
0 vote325 views1 answer
Intelilj javadoc: error - Malformed locale name: UTF8
Java