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
|
/* SPDX-License-Identifier: BSD-3-Clause */
/*
* Copyright © 2010, Zed A. Shaw.
* Copyright © 2020 rsiddharth <s@ricketyspace.net>
*/
#include <darray_algos.h>
int DArray_qsort(DArray *array, DArray_compare cmp)
{
qsort(array->contents, DArray_count(array), sizeof(void *), cmp);
return 0;
}
int DArray_heapsort(DArray *array, DArray_compare cmp)
{
return heapsort(array->contents, DArray_count(array),
sizeof(void *), cmp);
}
int DArray_mergesort(DArray *array, DArray_compare cmp)
{
return mergesort(array->contents, DArray_count(array),
sizeof(void *), cmp);
}
// Fucked Quick Sort.
int DArray_fucked_qsort_partition(DArray *array, DArray_compare cmp,
int low, int high)
{
int i = 0, j = 0, cmp_rc;
void *pivot = NULL, *tmp = NULL;
pivot = array->contents[high];
i = low - 1;
for (j = low; j < high; j++) {
cmp_rc = cmp(&array->contents[j], &pivot);
if (cmp_rc < 0) {
i = i + 1;
// swap
tmp = array->contents[j];
array->contents[j] = array->contents[i];
array->contents[i] = tmp;
}
}
cmp_rc = cmp(&array->contents[high], &array->contents[i + 1]);
if (cmp_rc < 0) {
tmp = array->contents[high];
array->contents[high] = array->contents[i + 1];
array->contents[i + 1] = tmp;
}
return i + 1;
}
int DArray_fucked_qsort_recurse(DArray *array, DArray_compare cmp,
int low, int high)
{
int rc = 0, p = 0;
if (low < high) {
p = DArray_fucked_qsort_partition(array, cmp, low, high);
check(p >= 0, "Failed to partition [%d-%d]", low, high);
rc = DArray_fucked_qsort_recurse(array, cmp, low, p - 1);
check(rc == 0, "Failed to quick sort sub array [%d-%d]", low, p-1);
rc = DArray_fucked_qsort_recurse(array, cmp, p + 1, high);
check(rc == 0, "Failed to quick sort sub array [%d-%d]", p+1, high);
}
return 0;
error:
return -1;
}
int DArray_fucked_qsort(DArray *array, DArray_compare cmp)
{
int rc;
rc = DArray_fucked_qsort_recurse(array, cmp, 0, DArray_end(array) - 1);
check(rc == 0, "Error sorting array.");
return 0;
error:
return -1;
}
// Fucked Heap Sort.
#define DArray_fucked_heapsort_iparent(i) ((floor(i - 1) / 2))
#define DArray_fucked_heapsort_ileft_child(i) ((2*i + 1))
#define DArray_fucked_heapsort_iright_child(i) ((2*i + 2))
static inline void DArray_fucked_heapsort_swap(DArray *array, int a, int b)
{
void *tmp = array->contents[a];
array->contents[a] = array->contents[b];
array->contents[b] = tmp;
}
int DArray_fucked_heapsort_sift_down(DArray *array, DArray_compare cmp,
int start, int end)
{
int root = start;
int child = 0;
int swap = 0;
while (DArray_fucked_heapsort_ileft_child(root) <= end) {
child = DArray_fucked_heapsort_ileft_child(root);
swap = root;
if (cmp(&array->contents[root], &array->contents[child]) < 0) {
swap = child;
}
if (((child + 1) <= end)
&& (cmp(&array->contents[swap], &array->contents[child + 1]) < 0)) {
swap = child + 1;
}
if (swap == root) {
break;
}
DArray_fucked_heapsort_swap(array, root, swap);
root = swap;
}
return 0;
}
int DArray_fucked_heapsort_heapify(DArray *array, DArray_compare cmp)
{
int count = DArray_count(array);
int start = (int) DArray_fucked_heapsort_iparent(count - 1);
int rc = 0;
while (start >= 0) {
rc = DArray_fucked_heapsort_sift_down(array, cmp, start, count - 1);
check(rc == 0, "Error sifting down at %d %d", start, count - 1);
start = start - 1;
}
return 0;
error:
return -1;
}
int DArray_fucked_heapsort(DArray *array, DArray_compare cmp)
{
int rc = 0, end = 0;
// First heapify array.
rc = DArray_fucked_heapsort_heapify(array, cmp);
check(rc == 0, "Error heapifying");
end = DArray_count(array) - 1;
while (end > 0) {
DArray_fucked_heapsort_swap(array, end, 0);
end = end - 1;
rc = DArray_fucked_heapsort_sift_down(array, cmp, 0, end);
check(rc == 0, "Error sifting down at %d %d", 0, end);
}
return 0;
error:
return -1;
}
// Fucked Merge Sort.
void DArray_fucked_topdown_merge(DArray *a, DArray *b,
int begin, int middle,
int end, DArray_compare cmp)
{
int i = 0, j = 0, k = 0;
i = begin;
j = middle;
for (k = begin; k < end; k++) {
if (i < middle &&
(j >= end || cmp(&a->contents[i], &a->contents[j]) < 0)) {
DArray_set(b, k, DArray_get(a, i));
i = i + 1;
} else {
DArray_set(b, k, DArray_get(a, j));
j = j + 1;
}
}
return;
}
void DArray_fucked_topdown_split_merge(DArray *b, DArray *a,
int begin, int end,
DArray_compare cmp)
{
if ((end - begin) < 2) {
return;
}
int middle = (end + begin) / 2;
DArray_fucked_topdown_split_merge(a, b, begin, middle, cmp);
DArray_fucked_topdown_split_merge(a, b, middle, end, cmp);
DArray_fucked_topdown_merge(b, a, begin, middle, end, cmp);
return;
}
int DArray_fucked_mergesort(DArray *array, DArray_compare cmp)
{
DArray *copy = DArray_shallow_copy(array);
check(copy != NULL, "Error shallow copying array");
DArray *a = NULL, *b = NULL;
int begin = 0, end = 0;
a = array;
b = copy;
begin = 0;
end = DArray_end(a);
DArray_fucked_topdown_split_merge(b, a, begin, end, cmp);
// Clean up copy
DArray_destroy(copy);
return 0;
error:
return -1;
}
|
