merge sort algorithm in java short answer

Thoughtless Thrush answered on January 17, 2022 Popularity 3/10 Helpfulness 3/10

answer merge sort algorithm in java short answer

merge sort algorithm in java short answer

Comment

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);
}

Popularity 3/10 Helpfulness 3/10 Language java

Source: www.baeldung.com

Tags: algorithm java merge short

Link to this answer
Share Copy Link

Contributed on Jan 17 2022

Thoughtless Thrush

0 Answers Avg Quality 2/10

merge sort algorithm in java short answer

Contents

More Related Answers

merge sort algorithm in java short answer

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.