-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1505022_Input.txt
133 lines (119 loc) · 6.28 KB
/
1505022_Input.txt
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
int arr[10];
int size;
void print(int x){
println(x);
}
void assign(){
arr[0] = 22; arr[1] = -5; arr[2] = 7; arr[3] = -110; arr[4] = 31; arr[5] = 28; arr[6] = 15; arr[7] = 33; arr[8] = 460; arr[9] = 145;
}
void merge(int l, int m, int r)
{
int i, j, k;
int n1, n2;
n1 = m - l + 1;
n2 = r - m;
/* create temp arrays */
int L[10], R[10];
/* Copy data to temp arrays L[] and R[] */
for (i = 0; i < n1; i++){
L[i] = arr[l + i];
}
for (j = 0; j < n2; j++){
R[j] = arr[m + 1+ j];
}
/* Merge the temp arrays back into arr[l..r]*/
i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy the remaining elements of L[], if there
are any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy the remaining elements of R[], if there
are any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
/* l is for left index and r is right index of the
sub-array of arr to be sorted */
void mergeSort(int l, int r)
{
if (l < r)
{
// Same as (l+r)/2, but avoids overflow for
// large l and h
int m ;
m = l+(r-l)/2;
// Sort first and second halves
mergeSort(l, m);
mergeSort(m+1, r);
merge(l, m, r);
}
}
void printArray();
int main(){
assign();
printArray();
mergeSort(0,size - 1);
print(6666);
printArray();
}
void printArray(){
size = 10;
int i;
print(7777); //Print array start bujhar jonne
for(i=0; i<size; i++){
print(arr[i]);
}
print(-7777); //To end printarray bujhar jonne
}
/*
Net theke
7777
22
-5
7
-110
31
28
15
33
460
145
-7777
6666
7777
-110
-5
7
15
22
28
31
33
145
460
-7777
*/