java-coding-problems/src/MergeSort.java at main · jfullstackdev/java-coding-problems · GitHub

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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
publicclassMergeSort {

publicstaticint[] mergeTwoSortedArrays(int[] one, int[] two) {

int[] sorted = newint[one.length + two.length];

inti = 0;
intj = 0;
intk = 0;

while (i < one.length && j < two.length) {

if (one[i] < two[j]) {
sorted[k] = one[i];
k++;
i++;
 } else {
sorted[k] = two[j];
k++;
j++;
 }
 }

if (i == one.length) {

while (j < two.length) {
sorted[k] = two[j];
k++;
j++;
 }
 }

if (j == two.length) {

while (i < one.length) {
sorted[k] = one[i];
k++;
i++;
 }
 }

returnsorted;

	}

publicstaticint[] mergeSort(int[] arr, intlo, inthi) {

if (lo == hi) {
int[] br = newint[1];
br[0] = arr[lo];

returnbr;
 }

intmid = (lo + hi) / 2;

int[] fh = mergeSort(arr, lo, mid);
int[] sh = mergeSort(arr, mid + 1, hi);

int[] merged = mergeTwoSortedArrays(fh, sh);

returnmerged;
	}

publicstaticvoidmain(String[] args) {

int[] arr = { 70, 50, 30, 10, 20, 40, 60 };

int[] merged = mergeSort(arr, 0, arr.length - 1);

for (intval : merged) {
System.out.print(val + " ");
 }

	}

}