/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 vote224 views1 answer
How does plus works in Java
Java
103 votes227 views5 answers
Switch expression java
Java
6 votes237 views2 answers
++i vs i++ java
Java
0 vote250 views2 answers
Spring 5 jdbctemplate query for a single value
Java Spring
6 votes229 views1 answer
How to close a jframe in java with an if statement
Java
0 vote241 views1 answer
Intellij disable welcome screen
Java
0 vote217 views2 answers
Fixed length array powershell
Java
0 vote228 views2 answers
Find power of number in method java
Java
-1 vote219 views1 answer
Devotional meaning
Java
14 votes231 views1 answer
Java bean
Java