/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 vote141 views1 answer
Loop an array of objects in java
Java
0 vote135 views1 answer
Html alert box android
Java
0 vote159 views8 answers
Xjava
Java
0 vote97 views1 answer
Java cambiar formato de fecha
Java
21 votes151 views3 answers
Bubble sort java
Java
0 vote148 views1 answer
$JAVA_HOME ENV
Java
1 vote137 views1 answer
Jbutton set background transparent
Java
0 vote164 views1 answer
Spring boot send username in email html template
Java Spring
3 votes146 views3 answers
Change java version
Java
0 vote188 views1 answer
Spring yml property boolean
Java Spring