-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.c
180 lines (167 loc) · 4.71 KB
/
sort.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
#include "sort.h"
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
/*
* TODO
* - memcpy optimization in insertionSort
* - quickSplit: change return value (swap needs check)
* - better file management(?)
*/
static int swap(void *data, int esize, int i, int j) {
void *tmp;
if ((tmp = malloc(esize)) == NULL)
return -1;
memcpy(tmp, data + esize * i, esize);
memcpy(data + esize * i, data + esize * j, esize);
memcpy(data + esize * j, tmp, esize);
free(tmp);
return 0;
}
int slSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
int sz = size - 1;
for (int i = 0; i < sz; i++) {
int minIndex = i;
for (int j = i + 1; j < size; j++)
if (compare(data + esize * j, data + esize * minIndex) < 0)
minIndex = j;
if (swap(data, esize, i, minIndex))
return -1;
}
return 0;
}
int isSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
void *key;
if ((key = malloc(esize)) == NULL)
return -1;
for (int k = 1; k < size; k++) {
memcpy(key, data + esize * k, esize);
int j;
for (j = k - 1; j >= 0 && compare(data + esize * j, key) > 0; j--) {
memcpy(data + esize * (j + 1), data + esize * j, esize);
}
memcpy(data + esize * (j + 1), key, esize);
}
free(key);
return 0;
}
int bbSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
int i = 1;
bool haveSwapped;
do {
haveSwapped = false;
for (int j = 1; j <= size - i; j++)
if (compare(data + esize * j, data + esize * (j - 1)) < 0) {
if (swap(data, esize, j, j - 1))
return -1;
haveSwapped = true;
}
i++;
} while (haveSwapped && i < size);
return 0;
}
static void merge(void *data, int esize, int i, int m, int f, void *auxArr, int (*compare)(const void *key1, const void *key2)) {
int i1, i2, k;
for (i1 = i, i2 = m, k = 0; i1 < m && i2 < f; k++) {
void *data1 = data + i1 * esize, *data2 = data + i2 * esize;
if (compare(data1, data2) < 0) {
memcpy(auxArr + k * esize, data1, esize);
i1++;
} else {
memcpy(auxArr + k * esize, data2, esize);
i2++;
}
}
if (i1 < m)
memcpy(auxArr + k * esize, data + i1 * esize, esize * (m - i1));
else
memcpy(auxArr + k * esize, data + i2 * esize, esize * (f - i2));
memcpy(data + i * esize, auxArr, esize * (f - i));
}
static int mergeSort(void *data, int esize, int i, int f, void *auxArr, int (*compare)(const void *key1, const void *key2)) {
if (f - i > 1) {
int m = (i + f) / 2;
if (mergeSort(data, esize, i, m, auxArr, compare))
return -1;
if (mergeSort(data, esize, m, f, auxArr, compare))
return -1;
merge(data, esize, i, m, f, auxArr, compare);
}
return 0;
}
int mgSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
void *auxArr;
if ((auxArr = malloc(size * esize)) == NULL)
return -1;
int retVal = mergeSort(data, esize, 0, size, auxArr, compare);
free(auxArr);
return retVal;
}
static int quickSplit(void *data, int esize, int p, int r, int (*compare)(const void *key1, const void *key2)) {
int l = p;
void *pAddr = data + p * esize;
while (l < r) {
do
r--;
while (compare(data + r * esize, pAddr) > 0);
do
l++;
while (l < r && compare(data + l * esize, pAddr) <= 0);
if (l < r)
swap(data, esize, l, r);
}
swap(data, esize, p, r);
return r;
}
static void quickSort(void *data, int esize, int i, int f, int (*compare)(const void *key1, const void *key2)) {
while (f - i > 1) {
int m = quickSplit(data, esize, i, f, compare);
if (m - i < f - m) {
quickSort(data, esize, i, m, compare);
i = m + 1;
} else {
quickSort(data, esize, m + 1, f, compare);
f = m;
}
}
}
int qkSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
quickSort(data, esize, 0, size, compare);
return 0;
}
static int fixHeap(void *data, int v, int l, int esize, int (*compare)(const void *key1, const void *key2)) {
void *tmp;
if ((tmp = malloc(esize)) == NULL)
return -1;
memcpy(tmp, data + esize * v, esize);
bool fixing = true;
do {
int u = 2 * v + 1;
if (u >= l)
fixing = false;
else {
if (u + 1 < l && compare(data + esize * (u + 1), data + esize * u) > 0)
u++;
if (compare(data + esize * u, tmp) > 0) {
memcpy(data + esize * v, data + esize * u, esize);
v = u;
} else
fixing = false;
}
} while (fixing);
memcpy(data + esize * v, tmp, esize);
free(tmp);
return 0;
}
int hpSort(void *data, int size, int esize, int (*compare)(const void *key1, const void *key2)) {
for (int i = size / 2; i >= 0; i--)
if (fixHeap(data, i, size, esize, compare))
return -1;
for (int l = size - 1; l >= 1; l--) {
if (swap(data, esize, 0, l))
return -1;
if (fixHeap(data, 0, l, esize, compare))
return -1;
}
return 0;
}