-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathMergeSort.java
More file actions
46 lines (42 loc) · 1.4 KB
/
MergeSort.java
File metadata and controls
46 lines (42 loc) · 1.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/**
* This program MergeSorts an int array.
* Created by Devang on 08-Jan-17.
*/
public class MergeSort {
public static void main(String[] args){
int[] array = {5, 8, 24, 15, 200, 192, 86, 35, 78, 4 ,9};
printArray(array);
array = sort(array);
printArray(array);
}
private static int[] sort(int[] array){
if (array.length <= 1)
return array;
int mid = array.length / 2;
int[] left = new int[mid];
int[] right = new int[array.length - mid];
System.arraycopy(array, 0, left, 0, array.length/2);
System.arraycopy(array, array.length/2, right, 0, array.length - array.length/2);
left = sort(left);
right = sort(right);
array = merge(array, left, right);
return array;
}
private static int[] merge(int[] array, int[] left, int[] right){
int l = 0, r = 0;
for(int i = 0; i < array.length; i++) {
if((r < right.length && l < left.length && left[l] <= right[r]) || r >= right.length){
array[i] = left[l++];
} else {
array[i] = right[r++];
}
}
return array;
}
private static void printArray(int[] collection){
for(int i = 0; i < collection.length; i++){
System.out.print("\t" + collection[i]);
}
System.out.println();
}
}