/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

2 votes154 views1 answer
Java chararray to int
Java
5 votes151 views1 answer
How generate a random number in java between 3 and 5
Java
0 vote139 views1 answer
Get today date in java 8
Java
0 vote136 views1 answer
Org.apache.hadoop.mapred.JobClient.runJob(JobClient.java:876)
Java
86 votes163 views8 answers
Java hello world
Java
0 vote127 views1 answer
Codepointat java
Java
0 vote89 views1 answer
ConnectionString connection timeOut mongodb java
Java
1 vote157 views1 answer
How to create a circle in java
Java
0 vote118 views1 answer
Number of matches regex java
Java
0 vote129 views1 answer
Java scan a file
Java