/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

5 votes121 views6 answers
Datatables
Java
1 vote123 views1 answer
Convert string into time in java
Java
0 vote121 views2 answers
Required a bean of type 'org.springframework.mail.javamail.JavaMailSender
Java
0 vote162 views3 answers
Spring boot sql logging
Java Spring
0 vote146 views1 answer
Java android development find element by id
Java
0 vote127 views1 answer
Spring data sql not utf8
Java
1 vote133 views1 answer
How to register event spiot
Java
0 vote118 views1 answer
Force_dark_auto android webview
Java
0 vote131 views1 answer
Vue composition watch
Java
0 vote128 views1 answer
Could not resolve project :app
Java