-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.cpp
237 lines (210 loc) · 5.93 KB
/
sort.cpp
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
/**
* @file sort.cpp
* @author yuyimiao(com@baidu.com)
* @date 2016/03/28 19:05:32
* @brief
*
**/
#include "sort.h"
#include "inc.h"
#include "math.h"
#include "string.h"
void swap(int* a, int* b) {
if(0 == a && 0 == b) return;
if(*a == *b) return;
*a += *b;
*b = *a - *b;
*a = *a - *b;
}
void insert(int* input, int value, int size, int k) {
if(0 >= k) return;
for(int i=size; i>0; i-=k) {
input[i] = input[i-k];
}
input[0] = value;
}
void insert(int* input, int value, int size) {
insert(input, value, size, 1);
}
void simple_insert_sort(int* input, int input_size, int k) {
if(0 == input) return;
if(0 >= k) return;
for(int i=k; i<input_size; i+=k) {
for(int o=0; o<i; o+=k) {
if(input[i] <= input[o]) {
insert(input + o, input[i], i - o, k);
}
}
}
}
void simple_insert_sort(int* input, int input_size) {
simple_insert_sort(input, input_size, 1);
}
void shell_sort(int* input, int input_size) {
if(0 == input) return;
int k = input_size / 2 - 1;
for(int i = k; i > 0; i--) {
for(int j=0; j<input_size; j++) {
simple_insert_sort(input + j, input_size - j, i);
}
print_vector(input, input_size);
}
}
int min_pos(int* input, int input_size, int k) {
if(0 == input) return -1;
int min_pos = 0;
for(int i=0; i<input_size; i+=k) {
if(input[min_pos] > input[i])
min_pos = i;
}
return min_pos;
}
int min_pos(int* input, int input_size) {
min_pos(input, input_size, 1);
}
void simple_min_sort(int* input, int input_size, int k) {
if(0 == input) return;
for(int i=0; i<input_size; i+=k) {
int min_position = min_pos(input + i, input_size - i, k) + i;
swap(input + i, input + min_position);
}
}
void simple_min_sort(int* input, int input_size) {
simple_min_sort(input, input_size, 1);
}
void heap_adjust(int* input, int input_size) {
/*l=2*f; r=2*f+1*/
/*father>left && father>right*/
/*deep*/
if(0 == input) return;
int deep = (int)log2(input_size);
for(int i=(int)pow(2, deep);i>0;i--) {
int f = i / 2;
int l = 2 * i + 1;
if(input[f] > input[i])
swap(input + f, input + i);
if(l < input_size && input[f] > input[l])
swap(input + f, input + l);
}
}
void heap_min_sort(int* input, int input_size) {
if(0 == input) return;
for(int i=0; i<input_size; i+=1) {
heap_adjust(input + i, input_size - i);
}
}
void bubble_sort(int* input, int input_size, int k) {
if(0 == input) return;
for(int i=0; i<input_size; i+=k) {
for(int j=0; j+k<input_size; j+=k) {
if(input[j] > input[j + k])
swap(input + j, input + j + k);
}
}
}
void bubble_sort(int* input, int input_size) {
bubble_sort(input, input_size, 1);
}
void quick_sort(int* input, int input_size, int k) {
if(0 == input || 1 >= input_size) return;
int ref = *input;
int ref_idx = 0;
int for_idx = 0;
int bak_idx = input_size - 1;
/*swap order: for_idx, bak_idx*/
while(for_idx < bak_idx) {
for_idx = 0;
bak_idx = input_size - 1;
while(input[bak_idx] > ref && bak_idx > for_idx) {
bak_idx--;
}
while(input[for_idx] < ref && bak_idx > for_idx) {
for_idx++;
}
swap(input + for_idx, input + bak_idx);
/*update ref_idx*/
if(ref_idx == for_idx) {
ref_idx = bak_idx;
}
else if(ref_idx == bak_idx) {
ref_idx = for_idx;
}
}
quick_sort(input, ref_idx, k);
quick_sort(input + ref_idx + 1, input_size - ref_idx - 1, k);
}
void quick_sort(int* input, int input_size) {
quick_sort(input, input_size, 1);
}
void swap_ptr(int* a, int* b) {
int* tmp;
tmp = a;
a = b;
b = tmp;
tmp = 0;
}
void merge_sort(int* input, int input_size) {
/*group:{{left},{right}}*/
/*g_step=2*(g_step+1)*/
/*while(ptr1,ptr2,ptr3){if()ptr1++;if()ptr2++,ptr3++}*/
if(0 == input || 1 >= input_size) return;
int* output = new int[input_size];
for(int g_step=2; g_step<=input_size; g_step=2*g_step) {
for(int i=0; i<input_size; i+=g_step) {
int l_ptr = i;
int r_ptr = i + g_step/2;
int o_ptr = i;
while(i + g_step/2 > l_ptr && i + g_step > r_ptr) {
if(input[l_ptr] < input[r_ptr]) {
output[o_ptr] = input[l_ptr];
l_ptr++;
}
else {
output[o_ptr] = input[r_ptr];
r_ptr++;
}
o_ptr++;
}
for(int j=l_ptr; j<i+g_step/2; j++) {
output[o_ptr] = input[j];
o_ptr++;
}
for(int j=r_ptr; j<i+g_step; j++) {
output[o_ptr] = input[j];
o_ptr++;
}
}
for(int i=0; i<input_size; i++) {
input[i] = output[i];
}
}
delete output;
output = 0;
}
void bucket_sort(int* input, int input_size, int max_scale) {
if(0 == input || 1 >= input_size) return;
//bucket begin
int buckets[10][BUCKET_SIZE] = {0};
int level[10] = {0};
//endof bucket
int scale = 0;
while(scale < max_scale) {
for(int i=0; i<input_size; i++) {
int buck = (input[i] / ((int)pow(10, scale))) % 10;
buckets[buck][level[buck]] = input[i];
level[buck]++;
}
int inc = 0;
for(int i=0; i<10; i++) {
for(int j=0; j<level[i]; j++) {
input[inc] = buckets[i][j];
inc++;
}
}
for(int i=0; i<10; i++) {
level[i] = 0;
}
scale++;
}
}
/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: */