/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 vote219 views2 answers
Spring boot fix cors problem
Java Spring
1 vote167 views2 answers
Java first day of week
Java
0 vote130 views1 answer
Convert hashset to arraylist
Java
0 vote220 views1 answer
Why are my if statements not working with inputs in java
Java
15 votes170 views2 answers
Convert text type to int java
Java
-1 vote164 views1 answer
Android cella 20*20 java
Java
1 vote168 views4 answers
Get last day of month java
Java
0 vote159 views1 answer
How to iterate a queue in java
Java
0 vote167 views1 answer
Strictfp java example
Java
0 vote179 views1 answer
How to create an entry in java
Java