/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 vote343 views1 answer
Java collection to list
Java
2 votes380 views3 answers
Convert bytebuffer to string
Java
1 vote320 views1 answer
Containskey java complexity
Java
0 vote367 views1 answer
Euclidean algorithm java recursive
Java
0 vote320 views1 answer
How can i convert an int to string java
Java
0 vote360 views2 answers
Java wait
Java
1 vote347 views1 answer
Java get enum from string
Java
23 votes319 views2 answers
Check last character of string java
Java
0 vote335 views1 answer
Java get classname
Java
3 votes359 views1 answer
Ternary operator java
Java