java_program/array/sorting/MergeSort.java at main · anuragkmr45/java_program · GitHub

History

52 lines (40 loc) · 1.15 KB

Raw

package array.sorting;

import java.util.Arrays;

public class MergeSort {

static int[] mergeSort(int[] array){

if (array.length == 1) {

return array;

}

int mid = array.length / 2;

int[] left = mergeSort(Arrays.copyOfRange(array, 0, mid));

int[] right = mergeSort(Arrays.copyOfRange(array, mid, array.length));

return merge(left, right );

}

static int[] merge(int[] first, int[] second) {

int[] mix = new int[first.length + second.length];

int i = 0;

int j = 0;

int k = 0;

while (i < first.length && j < second.length) {

if (first[i] < second[j]) {

mix[k] = first[i];

i++;

} else {

mix[k] = second[j];

}

k++;

}

// it may be possible that array is not complites then copy yht remaining array

while (i < first.length) {

mix[k] = first[i];

i++;

k++;

}

while (j < second.length) {

mix[k] = second[j];

j++;

k++;

}

return mix;

}

java_program/array/sorting/MergeSort.java at main · anuragkmr45/java_program · GitHub

Expand file tree

Breadcrumbs

MergeSort.java

Latest commit

History

Breadcrumbs

MergeSort.java

File metadata and controls