-
Notifications
You must be signed in to change notification settings - Fork 0
/
220410.c
316 lines (275 loc) · 7.31 KB
/
220410.c
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
// 알고리즘 과제
// Exchange, Merge, Quick, Heap, Radix sort 구현
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef struct node {
int val;
struct node *next;
}node;
typedef struct queue {
node *front;
node *rear;
}queue;
void Testing_case(int t_case[], int t_size);
int random_generator(int data[], int size);
void Exchage_sort(int data[], int size);
void Merge(int data[], int low, int mid, int high);
void Merge_sort(int data[], int low, int high);
void Quick_sort(int data[], int low, int high);
int Partition(int data[], int low, int high, int pivotpoint);
void MakeHeap(int data[], int size);
void Heap_sort(int data[], int size);
int IsEmpty(queue *q);
void Enqueue(queue *q, int data);
int Dequeue(queue *q);
void InitQueue(queue *q);
int get_digit(int data[], int size);
void Radix_sort(int data[], int size, int max_digit);
int main(int argc, char *argv[]) {
int case1[100], case2[500], case3[5000], case4[10000];
int size1 = 100, size2 = 500, size3 = 5000, size4 = 10000;
srand(time(NULL));
Testing_case(case1, size1);
Testing_case(case2, size2);
Testing_case(case3, size3);
Testing_case(case4, size4);
return 0;
}
void Testing_case(int t_case[], int t_size) {
float total_time = 0;
int repetition = 5;
clock_t start, end;
printf("\nTesting size = %d\n", t_size);
// Exchange sort
for(int i=0; i<repetition; i++){
random_generator(t_case, t_size);
start = clock();
Exchage_sort(t_case, t_size);
end = clock();
total_time += (float)(end - start)/CLOCKS_PER_SEC;
}
printf("Exchange sort's average time\t: %f\n", total_time / repetition);
total_time = 0;
// Merge sort
for(int i=0; i<repetition; i++){
random_generator(t_case, t_size);
start = clock();
Merge_sort(t_case, 0, t_size-1);
end = clock();
total_time += (float)(end - start)/CLOCKS_PER_SEC;
}
printf("Merge sort's average time\t: %f\n", total_time / repetition);
total_time = 0;
// Quick sort
for(int i=0; i<repetition; i++){
random_generator(t_case, t_size);
start = clock();
Quick_sort(t_case, 0, t_size-1);
end = clock();
total_time += (float)(end - start)/CLOCKS_PER_SEC;
}
printf("Quick sort's average time\t: %f\n", total_time / repetition);
total_time = 0;
// Heap sort
for(int i=0; i<repetition; i++){
random_generator(t_case, t_size);
start = clock();
Heap_sort(t_case, t_size);
end = clock();
total_time += (float)(end - start)/CLOCKS_PER_SEC;
}
printf("Heap sort's average time\t: %f\n", total_time / repetition);
total_time = 0;
// Radix sort
for(int i=0; i<repetition; i++){
random_generator(t_case, t_size);
int digit = get_digit(t_case, t_size);
start = clock();
Radix_sort(t_case, t_size, digit);
end = clock();
total_time += (float)(end - start)/CLOCKS_PER_SEC;
}
printf("Radix sort's average time\t: %f\n", total_time / repetition);
total_time = 0;
}
int random_generator(int data[], int size) {
for(int i=0; i<size; i++){
data[i] = rand() % size;
}
}
void Exchage_sort(int data[], int size) {
int temp = 0;
for(int i=0; i<size; i++) {
for(int j=0; j<size-1-i; j++) {
if(data[i]>data[j]) {
temp = data[i];
data[i] = data[j];
data[j] = temp;
}
}
}
}
void Merge(int data[], int low, int mid, int high) {
int i = low, j = mid+1 , k = low;
int *U = (int*)malloc(sizeof(int) * (high+1));
while(i<=mid && j<=high) {
if(data[i] < data[j]) {
U[k] = data[i];
i++;
}
else {
U[k] = data[j];
j++;
}
k++;
}
if (i > mid){
for(int l=j; l<=high; l++) {
U[k] = data[l];
k++;
}
}
else {
for(int l=i; l<=mid; l++) {
U[k] = data[l];
k++;
}
}
for(int l=low; l<=high; l++) {
data[l] = U[l];
}
free(U);
}
void Merge_sort(int data[], int low, int high) {
int mid = 0;
if(low < high) {
mid = (low + high) / 2;
Merge_sort(data, low, mid);
Merge_sort(data, mid+1, high);
Merge(data, low, mid, high);
}
}
int Partition(int data[], int low, int high, int pivotpoint) {
int i, j, tmp;
int pivotitem = data[low];
j = low;
for(i = low+1; i<=high; i++) {
if(data[i]<pivotitem) {
j++;
tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
pivotpoint = j;
tmp = data[low];
data[low] = data[pivotpoint];
data[pivotpoint] = tmp;
return pivotpoint;
}
void Quick_sort(int data[], int low, int high) {
int pivotpoint = 0;
if(high>low) {
pivotpoint = Partition(data, low, high, pivotpoint);
Quick_sort(data, low, pivotpoint-1);
Quick_sort(data, pivotpoint+1, high);
}
}
void MakeHeap(int data[], int size) {
for(int i=1; i<size; i++) {
int child = i;
do {
int root = (child - 1) / 2;
if(data[root] < data[child]) {
int tmp = data[root];
data[root] = data[child];
data[child] = tmp;
}
child = root;
} while(child != 0);
}
}
void Heap_sort(int data[], int size) {
MakeHeap(data, size);
for(int i=size-1; i>= 0; i--) {
int tmp = data[0];
data[0] = data[i];
data[i] = tmp;
int root = 0;
int child = 1;
do {
child = 2*root + 1;
if(child<i-1 && data[child]<data[child+1]) {
child++;
}
if(child<i && data[root]<data[child]) {
tmp = data[root];
data[root] = data[child];
data[child] = tmp;
}
root = child;
} while(child<i);
}
}
int IsEmpty(queue *q) {
return q->front == NULL;
}
void Enqueue(queue *q, int val) {
node *new_node = (node *)malloc(sizeof(node));
new_node->val = val;
new_node->next = NULL;
if(IsEmpty(q)) {
q->front = new_node;
}
else {
q->rear->next = new_node;
}
q->rear = new_node;
}
int Dequeue(queue *q) {
int val;
node *n;
if(IsEmpty(q)) {
return -1;
}
n = q->front;
val = n->val;
q->front = n->next;
free(n);
return val;
}
void InitQueue(queue *q) {
q->front = q->rear = NULL;
}
int get_digit(int data[], int size) {
int max = 0, max_digit = 1;
for(int i=0; i<size; i++) {
if(max<data[i]) {
max = data[i];
}
}
while(max/10>0) {
max /= 10;
max_digit++;
}
return max_digit;
}
void Radix_sort(int data[], int size, int max_digit) {
queue buckets[10];
int factor = 1;
for(int i=0; i<10; i++) {
InitQueue(&buckets[i]);
}
for(int i=0; i<max_digit; i++) {
for(int j=0; j<size; j++) {
Enqueue(&buckets[(data[j]/factor)%10], data[j]);
}
for(int k=0,j=0; k<10; k++) {
while(!IsEmpty(&buckets[k])) {
data[j++] = Dequeue(&buckets[k]);
}
}
factor *= 10;
}
}