algorithms/Java/MergeSort.java at master · AASF-IIITM/algorithms · 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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}
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
78
79
80
81
82
83
84
85
86
87
classMergeSort {

voidmerge(intarr[], intl, intm, intr)
	{
intn1 = m - l + 1;
intn2 = r - m;

intL[] = newint[n1];
intR[] = newint[n2];

for (inti = 0; i < n1; ++i)
L[i] = arr[l + i];
for (intj = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];


inti = 0, j = 0;


intk = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
 }
else {
arr[k] = R[j];
j++;
 }
k++;
 }


while (i < n1) {
arr[k] = L[i];
i++;
k++;
 }


while (j < n2) {
arr[k] = R[j];
j++;
k++;
 }
	}


voidsort(intarr[], intl, intr)
	{
if (l < r) {

intm = (l + r) / 2;


sort(arr, l, m);
sort(arr, m + 1, r);


merge(arr, l, m, r);
 }
	}

staticvoidprintArray(intarr[])
	{
intn = arr.length;
for (inti = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
	}


publicstaticvoidmain(Stringargs[])
	{
intarr[] = { 12, 11, 13, 5, 6, 7 };

System.out.println("Given Array");
printArray(arr);

MergeSortob = newMergeSort();
ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array");
printArray(arr);
	}
}