-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.cpp
More file actions
105 lines (86 loc) · 1.98 KB
/
MergeSort.cpp
File metadata and controls
105 lines (86 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#pragma region LICENSE
// Copyright 2019 PaleCosmos
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma endregion
#include "../Data.h"
int temps[size];
int devide(int, int);
void conqurer(int *, int, int);
void combine(int *, int, int, int);
void mergeSort(int *arr)
{
conqurer(arr, 0, size - 1);
}
int main()
{
clock_t start, end;
int *arr = arrData;
print(arr, "Before");
start = clock();
mergeSort(arr);
end = clock();
print(arr, "\nAfter");
timeStamp(start, end); // 2ms
return 0;
}
int devide(int left, int right)
{
return (left + (right - left) / 2);
}
void conqurer(int *arr, int left, int right)
{
if (left < right)
{
int mid = devide(left, right);
conqurer(arr, left, mid);
conqurer(arr, mid + 1, right);
combine(arr, left, mid, right);
}
}
void combine(int *arr, int left, int mid, int right)
{
int i = left;
int j = mid + 1;
int k = left;
int l;
while (i <= mid && j <= right)
{
if (arr[i] <= arr[j])
{
temps[k++] = arr[i++];
}
else
{
temps[k++] = arr[j++];
}
}
if (i > mid)
{
for (l = j; l <= right; l++)
{
temps[k++] = arr[l];
}
}
else
{
for (l = i; l <= mid; l++)
{
temps[k++] = arr[l];
}
}
for (l = left; l <= right; l++)
{
arr[l] = temps[l];
}
}