/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

1 vote397 views1 answer
Spring mvc project example
Java Spring
4 votes313 views2 answers
Java round to nearest 5
Java
0 vote304 views1 answer
Print 1 to 10 using thread in java
Java
-1 vote322 views1 answer
Mysql connection details in springboot
Java
0 vote383 views1 answer
Spring boot eureka , zual hystrix, rest api docs
Java Spring
17 votes324 views10 answers
Time
Java
0 vote321 views1 answer
How to print message to console java
Java
0 vote340 views1 answer
2048 java code
Java
0 vote336 views1 answer
Jbutton border size java
Java
1 vote314 views1 answer
Jdbc interface
Java