/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

4 votes143 views2 answers
ReentrantLock java
Java
1 vote132 views1 answer
Bungeecord plugin add configs
Java
16 votes147 views5 answers
How to uppercase the first letter of a string in java
Java
0 vote132 views1 answer
How to not allow a user to enter a mark greater than 100 or below 0 in java
Java
0 vote147 views1 answer
Javafx how to put multiple handlers in the same line
Java
0 vote143 views1 answer
How to get cpu model number in android programmatically
Java
1 vote150 views1 answer
Android gridview viewholder button onclick
Java
0 vote153 views1 answer
Convert base64 to pdf object for pdf reader in android studio
Java
0 vote177 views1 answer
Declaration of double array in java
Java
0 vote153 views1 answer
Thymeleaf Expression Object dialects
Java