/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 vote281 views1 answer
Timestamp with zone java
Java
1 vote240 views1 answer
Gradle sqlite jdbc
Java
0 vote309 views1 answer
Original authors: Talmon Marco, Igor Magazinnik Programming languages: Java, C, Python, C , Qt, Objective-C
Java
1 vote254 views2 answers
Java get number out of string
Java
0 vote260 views1 answer
Java repeat last 3 letters of string
Java
0 vote273 views1 answer
Update role spring security
Java
5 votes255 views2 answers
Java create inputstream from string
Java
0 vote308 views1 answer
How to check the lines in a file java scanner
Java
0 vote284 views1 answer
ArrayList<HashMap<String, String>> arrayList = new ArrayList<>()
Java
0 vote308 views1 answer
How to set two different table admin and user for separate jwt token in spring boot
Java Spring