blob: 3d9df504cb0bc4a5361f30826f5f8da1658e6741 (
plain)
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
|
int arr[100];
void merge(int start, int mid, int end) {
int result[100];
int k = 0;
int i = start;
int j = mid + 1;
while (i <= mid && j <= end) {
if (arr[i] < arr[j]) {
result[k] = arr[i];
k = k + 1;
i = i + 1;
}
else {
result[k] = arr[j];
k = k + 1;
j = j + 1;
}
}
if (i == mid + 1) {
while (j <= end) {
result[k] = arr[j];
k = k + 1;
j = j + 1;
}
}
if (j == end + 1) {
while (i <= mid) {
result[k] = arr[i];
k = k + 1;
i = i + 1;
}
}
j = 0;
i = start;
while(j < k){
arr[i] = result[j];
i = i + 1;
j = j + 1;
}
}
void mergeSort( int start, int end) {
if (start >= end)
return;
int mid = (start + end) / 2;
mergeSort(start, mid);
mergeSort(mid + 1, end);
merge(start, mid, end);
}
void printArray(int n)
{
int i = 0;
while (i < n)
{
putint(arr[i]);
putch(32);
// printf("%d ", arr[i]);
i = i + 1;
}
}
int main()
{
int n;
int i = 0;
n = getint();
while (i < n)
{
arr[i] = getint();
i = i + 1;
}
mergeSort(0,n-1);
printArray(n);
return 0;
}
|
