/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 vote125 views1 answer
What Is Spring Boot and What Are Its Main Features?
Java Spring
5 votes111 views2 answers
Java list of lists
Java
159 votes287 views6 answers
SCANNER CLASS IN JAVA
Java
2 votes103 views2 answers
How to navigate to last back stack in android studio
Java
0 vote109 views1 answer
Java program for wind-chill temperature
Java
0 vote139 views1 answer
Print zpl from java
Java
0 vote107 views1 answer
Java inser at index
Java
0 vote117 views2 answers
Transparent dialog in android
Java
0 vote104 views1 answer
Nth fibonacci number java using for loop
Java
0 vote112 views2 answers
How-to-use-volley-string-request-in-android
Java