Repository navigation
Expand file tree
/
Copy pathsort.cpp
More file actions
342 lines (338 loc) · 6.75 KB
/
Copy pathsort.cpp
File metadata and controls
342 lines (338 loc) · 6.75 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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
#include "head.h"
void printArr(int arr[],int length);
int main(int argc, char const *argv[])
{
int num = 20;
int arr[num];
for(int i=0;i<num;i++)
{
arr[i] = rand()%1000;
}
printArr(arr,num);
// BubbleSort(arr,0,num-1);
// QuickSort(arr,0,num -1);
// SelectionSort(arr,0,num-1);
// HeapSort(arr,num);
// InsertSort(arr,0,num-1);
// ShellSort(arr,0,num-1);
// MergeSort(arr,0,num-1);
int temp[] = {1,10,100,1000,10000};
// RadixSort_LSD(arr,0,num-1,4,temp);
// RadixSort_MSD(arr,0,num-1,4,temp);
printArr(arr,num);
return 0;
}
void BubbleSort(int arr[],int begin,int end)
{
for (int i = begin,num=0; i < end; ++i,++num)
{
for(int j = begin;j<end-num;++j)
{
if(arr[j]>arr[j+1])
{
Swap(arr,j,j+1);
}
}
}
}
void QuickSort(int arr[],int begin,int end)
{
if(end-begin+1<10)
{
BubbleSort(arr,begin,end);
return;
}
PatitionMedianOfThree(arr,begin,end);
int left = begin;
int first = begin;
int right = end;
int last = end;
int leftNum = 0;
int rightNum = 0;
int key = arr[begin];
while(first<last)
{
while(first<last && arr[last]>=key)
{
if(arr[last] == key)
{
Swap(arr,last,right);
right--;
rightNum++;
}
last--;
}
arr[first] = arr[last];
while(first<last && arr[first] <= key)
{
if(arr[first] == key)
{
Swap(arr,left,first);
left++;
leftNum++;
}
first++;
}
arr[last] = arr[first];
}
arr[first] = key;
int i = begin;
int j = first-1;
while(i<left && arr[j]!=key)
{
Swap(arr,i,j);
i++;
j--;
}
i= end;
j = last+1;
while(i>right && arr[j]!=key)
{
Swap(arr,i,j);
i--;
j++;
}
QuickSort(arr,begin,first-1-leftNum);
QuickSort(arr,last+1+rightNum,end);
}
void SelectionSort(int arr[],int begin,int end)
{
int minIndex=0;
int maxIndex=0;
for(int i = begin,num =0;i<begin+(end-begin+1)/2;i++,num++)
{
minIndex = i;
maxIndex = i;
for(int j = i+1;j<=end-num;j++)
{
if(arr[minIndex]>arr[j])
{
minIndex = j;
continue;
}
if(arr[maxIndex]<arr[j])
{
maxIndex = j;
}
}
if(minIndex!=i)
{
Swap(arr,minIndex,i);
}
if(maxIndex!=i)
{
Swap(arr,maxIndex,end-num);
}
}
}
void HeapSort(int arr[],int length)
{
for(int i = length/2-1;i>=0;i--)
{
HeapAdjust(arr,i,length-1);
}
for(int i = length-1;i>=1;i--)
{
Swap(arr,0,i);
HeapAdjust(arr,0,i-1);
}
}
void InsertSort(int arr[],int begin,int end)
{
for(int i = begin+1;i<=end;i++)
{
for(int j = i-1;j>=0 && arr[j]>arr[j+1];j--)
{
Swap(arr,j,j+1);
}
}
}
void ShellSort(int arr[],int begin,int end)
{
int shell[3] = {5,3,1};
for(int k = 0;k<3;k++)
{
for(int i = begin+shell[k];i<=end;i++)
{
for(int j = i-shell[k];j>=0 && arr[j]>arr[j+1];j-=shell[k])
{
Swap(arr,j,j+1);
}
}
}
}
void MergeSort(int arr[],int begin,int end)
{
if(begin!=end)
{
int mid = (end+begin)/2;
MergeSort(arr,begin,mid);
MergeSort(arr,mid+1,end);
Merger(arr,begin,mid,end);
}
}
void RadixSort_MSD(int arr[],int begin,int end,int d,int temp[])
{
int radix = 10;
int count[radix];
int bucket[end-begin+1];
int i;
int j;
for(i = 0;i<radix;i++)
{
count[i] = 0;
}
for(i=begin;i<=end;i++)
{
count[getdigit(arr[i],temp[d-1])]++;
}
for(i = 1;i<radix;i++)
{
count[i] = count[i]+count[i-1];
}
int maxIndex = count[radix-1];
for(i=end;i>=begin;i--)
{
j = getdigit(arr[i],temp[d-1]);
bucket[count[j]-1] = arr[i];
count[j]--;
}
for(i = begin,j=0;i<=end;i++,j++)
{
arr[i] = bucket[j];
}
for(i = 0;i<radix;i++)
{
int p1 = count[i];
int p2 = i==radix-1?maxIndex-1:count[i+1]-1;
if(p1<p2 && d>1)
{
RadixSort_MSD(arr,p1,p2,d-1,temp);
}
}
}
void RadixSort_LSD(int arr[],int begin,int end,int d,int temp[])
{
int radix = 10;
int count[radix];
int bucket[end-begin+1];
int i;
int j;
for(int k = 0;k<d;k++)
{
for(i = 0;i<radix;i++)
{
count[i] = 0;
}
for(i=begin;i<=end;i++)
{
count[getdigit(arr[i],temp[k])]++;
}
for(i = 1;i<radix;i++)
{
count[i] = count[i]+count[i-1];
}
for(i=end;i>=begin;i--)
{
j = getdigit(arr[i],temp[k]);
bucket[count[j]-1] = arr[i];
count[j]--;
}
for(i = begin,j=0;i<=end;i++,j++)
{
arr[i] = bucket[j];
}
}
}
void PatitionMedianOfThree(int arr[],int begin,int end)
{
int mid = begin+(end-begin)/2;
if(arr[mid]>arr[end])
{
Swap(arr,mid,end);
}
if(arr[begin]>arr[end])
{
Swap(arr,begin,end);
}
if(arr[mid]>arr[begin])
{
Swap(arr,mid,begin);
}
}
void HeapAdjust(int arr[],int begin,int end)
{
int key = arr[begin];
for(int i = 2*begin+1;i<=end;i=2*i+1)
{
if(i<end && arr[i]<arr[i+1])
{
i++;
}
if(key<arr[i])
{
arr[begin] = arr[i];
begin = i;
}
else
{
break;
}
}
arr[begin] = key;
}
void Merger(int arr[],int begin,int mid,int end)
{
int temp[end-begin+1];
int index = 0;
int i = begin;
int j = mid+1;
while(i<=mid && j<=end)
{
if(arr[i]>arr[j])
{
temp[index] = arr[j];
j++;
}
else
{
temp[index] = arr[i];
i++;
}
index++;
}
while(i<=mid)
{
temp[index] = arr[i];
i++;
index++;
}
while(j<=end)
{
temp[index] = arr[j];
j++;
index++;
}
for(i = begin,j=0;i<=end;i++,j++)
{
arr[i] = temp[j];
}
}
int getdigit(int i,int j)
{
return i/j%10;
}
void Swap(int arr[],int a,int b)
{
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
void printArr(int arr[],int length)
{
for (int i = 0; i < length; ++i)
{
printf("%d\t", arr[i]);
}
printf("\n");
}