/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 vote370 views1 answer
The root directory of the External Storage is:
Java
8 votes342 views4 answers
Java loop through object
Java
0 vote379 views2 answers
Open camera in android
Java
6 votes400 views1 answer
Java int to binary
Java
0 vote381 views1 answer
Java init arraylist string
Java
0 vote386 views3 answers
How to move get selected from jfxtreetableview javafx
Java
0 vote350 views1 answer
Odd or even program in java using a mod operator
Java
1 vote455 views2 answers
Convert if else to ternary operator online
Java
0 vote351 views1 answer
Count occurrences in seven integers using java single dimension arrays
Java
9 votes353 views2 answers
How to change double to int in java
Java