/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 vote378 views1 answer
Add image in loggin view spring boot security
Java
5 votes374 views1 answer
Java for map
Java
0 vote421 views1 answer
Spring mock Streamble of object
Java Spring
12 votes535 views2 answers
Run spring boot application command line
Java Spring
0 vote336 views1 answer
Get array element java
Java
1 vote341 views1 answer
Final double in java
Java
0 vote381 views3 answers
FlutterFirebaseCorePlugin.java uses or overrides a deprecated API.
Java
0 vote349 views1 answer
Longadder
Java
0 vote344 views1 answer
16 kare koku 4 in java
Java
0 vote346 views1 answer
How to disable coming back to activity android studio
Java