forked from pranjal36/SortingAlgorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMerge-sort.java
More file actions
86 lines (72 loc) · 1.98 KB
/
Merge-sort.java
File metadata and controls
86 lines (72 loc) · 1.98 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
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
class Sort
{
void merge(int arr[], int left, int middle, int right)
{
int low = middle - left + 1;
int high = right - middle;
int L[] = new int[low];
int R[] = new int[high];
int i = 0, j = 0;
for (i = 0; i < low; i++)
{
L[i] = arr[left + i];
}
for (j = 0; j < high; j++)
{
R[j] = arr[middle + 1 + j];
}
int k = left;
i = 0;
j = 0;
while (i < low && j < high)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
while (i < low)
{
arr[k] = L[i];
i++;
k++;
}
while (j < high)
{
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int left, int right)
{
int middle;
if (left < right) {
middle = (left + right) / 2;
mergeSort(arr, left, middle);
mergeSort(arr, middle + 1, right);
merge(arr, left, middle, right);
}
}
void display(int arr[])
{
for (int i=0; i<arr.length; ++i)
{
System.out.print(arr[i]+" ");
}
}
public static void main(String args[])
{
int arr[] = { 9, 3, 1, 5, 13, 12 };
Sort ob = new Sort();
ob.mergeSort(arr, 0, arr.length - 1);
ob.display(arr);
}
}