/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 vote234 views1 answer
Charat(0).touppercase() java
Java
0 vote229 views1 answer
How to get string input line in java
Java
5 votes250 views2 answers
Math.absolute java
Java
1 vote244 views1 answer
Space seperator in string in java
Java
6 votes239 views1 answer
Android studio webview mailto
Java
0 vote231 views1 answer
Round bg android
Java
56 votes232 views6 answers
String remove last character
Java
0 vote222 views1 answer
Check authorities spring
Java
2 votes270 views2 answers
Array ausgeben java
Java
0 vote249 views2 answers
Java determine number of cpu cores
Java