/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

3 votes203 views1 answer
How can i to do java home
Java
1 vote185 views1 answer
How to addin java
Java
0 vote193 views1 answer
Java resto
Java
1 vote181 views1 answer
Highlight selected item in recyclerview android
Java
1 vote233 views1 answer
Java try catch integer.parseint
Java
5 votes206 views2 answers
Select java version linux
Java
0 vote181 views1 answer
Java double to string fixed precision
Java
0 vote190 views1 answer
Spring boot init method
Java
0 vote145 views2 answers
Highlight text in android studio
Java
1 vote197 views1 answer
Java remove first digit from int
Java