-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathSort.h
More file actions
239 lines (220 loc) · 4.35 KB
/
Sort.h
File metadata and controls
239 lines (220 loc) · 4.35 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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
// Author : XuBenHao
// Version : 1.0.0
// Mail : xbh370970843@163.com
// Copyright : XuBenHao 2020 - 2030
#ifndef ALLIB_ALGORITHM_SORT_QUICKSORT_H
#define ALLIB_ALGORITHM_SORT_QUICKSORT_H
#include "..\..\stdafx.h"
namespace AlLib
{
namespace Algorithm
{
namespace Sort
{
// todo
// 考虑可调用对象，可调用对象有值，无值判断
class Helper
{
public:
template <typename T>
static void QuickSort(
T* pS_,// 指向排序首对象指针
T* pE_,
std::function<int(const T&, const T&)> compareFun_
= [](const T& nT1_, const T& nT2_)->int
{
if (nT1_ > nT2_)
{
return 1;
}
else if (nT1_ < nT2_)
{
return -1;
}
else
{
return 0;
}
});// 指向排序尾后对象指针
// 总体思想：
// 把大集合划分为两个小集合，对小集合排序
// 对有序小集合进行合并
// 得到有序的大集合
template <typename T>
static void MergeSort(
T* pS_,
T* pE_,
std::function<int(const T&, const T&)> compareFun_
= [](const T& nT1_, const T& nT2_)->int
{
if (nT1_ > nT2_)
{
return 1;
}
else if (nT1_ < nT2_)
{
return -1;
}
else
{
return 0;
}
});
private:
template <typename T>
static T* Partition(
T* pS_,
T* pE_,
std::function<int(const T&, const T&)> compareFun_);
template <typename T>
static void Merge(
T* pStart_,
T* pMid_,
T* pEnd_,
std::function<int(const T&, const T&)> compareFun_);
};
template <typename T>
void Helper::QuickSort(
T* pS_,
T* pE_,
std::function<int(const T&, const T&)> compareFun_)
{
int _nNum = pE_ - pS_;
if (_nNum <= 1)
{
return;
}
T* _pMain = Partition(pS_, pE_, compareFun_);
QuickSort(pS_, _pMain, compareFun_);
QuickSort(_pMain + 1, pE_, compareFun_);
}
// 返回值：
// 指针主元对象指针【主元对象左边元素小于主元，主元对象右边元素大于主元】
template <typename T>
T* Helper::Partition(
T* pS_,// 执行排序首对象指针
T* pE_,
std::function<int(const T&, const T&)> compareFun_)// 指向排序尾后对象指针
{
T _nMain = *pS_;
T* _pL = pE_ - 1;
T* _pEmpty = pS_;
while (true)
{
// 终止检测
if (_pEmpty == _pL)
{
break;
}
// 将_pF位置元素与主元比较
int _nRet = compareFun_(*(_pEmpty + 1), _nMain);
if (_nRet <= 0)
{
*_pEmpty = *(_pEmpty + 1);
_pEmpty++;
}
else
{
T _nTemp = *_pL;
*_pL = *(_pEmpty + 1);
*(_pEmpty + 1) = _nTemp;
_pL--;
}
}
*_pEmpty = _nMain;
return _pEmpty;
}
template <typename T>
void Helper::MergeSort(
T* pS_,
T* pE_,
std::function<int(const T&, const T&)> compareFun_)
{
int _nNum = pE_ - pS_;
if (_nNum <= 1)
{
return;
}
T* _pMiddle = pS_ + _nNum / 2;
MergeSort(pS_, _pMiddle, compareFun_);
MergeSort(_pMiddle, pE_, compareFun_);
Merge(pS_, _pMiddle, pE_, compareFun_);
}
template <typename T>
void Helper::Merge(
T* pStart_,
T* pMid_,
T* pEnd_,
std::function<int(const T&, const T&)> compareFun_)
{
int _nNum1 = (pMid_ - pStart_);
int _nNum2 = (pEnd_ - pMid_);
T* _arr1 = nullptr;
T* _arr2 = nullptr;
try
{
_arr1 = new T[_nNum1];
}
catch (...)
{
_arr1 = nullptr;
throw "out of memory";
}
try
{
_arr2 = new T[_nNum2];
}
catch (...)
{
_arr2 = nullptr;
throw "out of memory";
}
for (int _i = 0; _i < _nNum1; _i++)
{
_arr1[_i] = *(pStart_ + _i);
}
for (int _i = 0; _i < _nNum2; _i++)
{
_arr2[_i] = *(pMid_ + _i);
}
int _i = 0;
int _j = 0;
T* _pTemp = pStart_;
while (_i < _nNum1 && _j < _nNum2)
{
int _nRet = compareFun_(_arr1[_i], _arr2[_j]);
if (_nRet <= 0)
{
*_pTemp = _arr1[_i++];
}
else
{
*_pTemp = _arr2[_j++];
}
_pTemp++;
}
if (_i == _nNum1)
{
for (int _k = _j; _k < _nNum2; _k++)
{
*_pTemp = _arr2[_k];
_pTemp++;
}
}
else
{
for (int _k = _i; _k < _nNum1; _k++)
{
*_pTemp = _arr1[_k];
_pTemp++;
}
}
delete[] _arr1;
_arr1 = nullptr;
delete[] _arr2;
_arr2 = nullptr;
}
}
}
}
#endif