-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_sort.cpp
More file actions
112 lines (91 loc) · 2.18 KB
/
merge_sort.cpp
File metadata and controls
112 lines (91 loc) · 2.18 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
106
107
108
109
110
111
112
# include "iostream"
using namespace std;
// 使用shell排序算法排序
void merge(int a[], int low, int m, int high)
{
int i = low, j = m + 1, k =0;
int temp[high - low + 1];
while (i <= m && j <= high)
{
if (a[i] <= a[j])
{
temp[k++] = a[i++];
}
else
{
temp[k++] = a[j++];
}
}
while (i <= m)
{
/* code */
temp[k++] = a[i++];
}
while (j <= high)
{
/* code */
temp[k++] = a[j++];
}
k = 0;
for (int i = low; i <= high; i++)
{
a[i] = temp[k++];
}
}
void mergeSort(int a[], int p, int q){
if (p < q)
{
int r = (p + q) / 2;
mergeSort(a, p, r);
mergeSort(a, r + 1, q);
merge(a, p, r, q);
}
}
int main(){
int input_data[20] =
{32, 2, 43, 0, 43,
11, 48, 983, 56, 43,
11, 0, 87, 66, 42,
31, 22, 20, 98, 35};
// 输入部分
{
// for(int i = 0; i < 20; i++)
// {
// /* code */
// try
// {
// cout << "please input the value of " << i << endl;
// cin >> input_data[i];
// /* code */
// }
// catch(const std::exception& e)
// {
// std::cerr << e.what() << '\n';
// }catch(io_errc e){
// cout << e;
// }
// }
cout << endl << "input complete!" << endl;
cout << "input result:";
for(int i = 0; i < 20; i++)
cout << input_data[i] << ", ";
cout << endl;
}
// 算法部分
try{
mergeSort(input_data, 0, 19);
}catch(const std::exception& e){
std::cerr << e.what() << '\n';
cout << "出现异常!";
}
// 输出部分
{
cout << "sort completed!" << endl;
cout << "sorted result:";
for(int i = 0; i < 20; i++)
{
cout << input_data[i] << ",";
}
}
return 0;
}