/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 vote326 views1 answer
How to access elements in an array java using try catch
Java
0 vote375 views1 answer
How to convert timestamp to time in android studio
Java
0 vote354 views2 answers
Java convert am pm to 24 hour
Java
20 votes365 views2 answers
Color from hex code flutter
Java
2 votes344 views1 answer
Java what is integer
Java
1 vote364 views3 answers
Statusbar text color android
Java
1 vote351 views1 answer
How to solve simultaneous equations in mathematica
Java
2 votes334 views1 answer
Edittext color
Java
-2 votes316 views1 answer
How to read mail content using java
Java
-1 vote295 views1 answer
Date to string java
Java