/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

3 votes223 views2 answers
Processing load font from file
Java
0 vote247 views2 answers
Java empty arraylist
Java
0 vote306 views1 answer
P=
Java
1 vote247 views1 answer
Programmation android avoir acces à la liste des instants de partage
Java
0 vote256 views1 answer
How to check when edittext clicked android
Java
0 vote239 views1 answer
Path in spring form
Java
0 vote278 views1 answer
Android canvas line thickness
Java
11 votes272 views6 answers
Print in java
Java
2 votes240 views1 answer
Java swing button on click
Java
3 votes286 views4 answers
Math java
Java