/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

1 vote299 views1 answer
How to traverse stack in java
Java
51 votes290 views6 answers
Java array print
Java
7 votes296 views1 answer
Reading in lines from a file java
Java
15 votes302 views6 answers
How to format a double in java to 2 decimal places
Java
0 vote282 views1 answer
Programme javascrip mineur et majaur
Java
15 votes288 views2 answers
Ansi colors
Java
0 vote289 views1 answer
Android videoview not smooth for mp4
Java
0 vote360 views1 answer
Spring boot access images in resources folder
Java Spring
1 vote307 views1 answer
How to print multiple lines in java
Java
0 vote313 views1 answer
Why static variables cannot be serialized in java
Java