/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

5 votes105 views2 answers
Different types of variables in java
Java
1 vote120 views1 answer
Spigot execute command as player
Java
2 votes117 views1 answer
From string to double andoird studio
Java
15 votes110 views3 answers
How to print a matrix in java
Java
0 vote124 views1 answer
Android view set padding programmatically
Java
0 vote117 views1 answer
Jframe centerlaized
Java
2 votes109 views2 answers
Java file dialog
Java
1 vote108 views1 answer
Bukkit for every player
Java
0 vote124 views1 answer
Start activity for result deprecate
Java
0 vote150 views3 answers
Spring boot sql logging
Java Spring