/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

2 votes304 views1 answer
Java garbage collection
Java
0 vote271 views1 answer
Unmodifiable list java
Java
0 vote317 views1 answer
Java thyemleaf save table form to database
Java
0 vote334 views1 answer
Java format zero padded binary
Java
6 votes349 views1 answer
How to select a random element from an array in java
Java
3 votes383 views1 answer
Spigot custom join message
Java
0 vote353 views1 answer
How to set landscape in android studio
Java
0 vote309 views1 answer
Conexion a mysql java
Java
0 vote320 views1 answer
Mile to nautical mile
Java
0 vote316 views1 answer
Hourglass Java
Java