/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 vote199 views1 answer
Does not have a NavController set on 2131231008
Java
0 vote200 views1 answer
Put in spring rest api
Java
0 vote219 views1 answer
Java resultset to object
Java
0 vote218 views2 answers
Assert log in unit testing
Java
0 vote192 views1 answer
Jacoco code coverage
Java
0 vote190 views1 answer
Java get current desktop
Java
9 votes161 views1 answer
Ova definition
Java
2 votes208 views1 answer
Android studio remove notification bar
Java
0 vote184 views3 answers
HashMap to Pojo
Java
0 vote216 views2 answers
Decision tree drools using spring boot
Java Spring