/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 vote133 views1 answer
Matrix program
Java
0 vote115 views1 answer
Compress a directory in java
Java
0 vote118 views1 answer
Open google maps cycling navigation
Java
-2 votes126 views2 answers
Hashset in java
Java
1 vote138 views1 answer
How to get index of second occurrence java
Java
8 votes111 views1 answer
Float to string java
Java
24 votes125 views6 answers
Arrays in java
Java
0 vote125 views1 answer
How to call a non static method
Java
3 votes128 views1 answer
Java every second
Java
12 votes118 views3 answers
Start activity intent
Java