This repository has been archived by the owner on Jul 8, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.c
268 lines (195 loc) · 6.65 KB
/
test.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
#include "test.h"
int main() {
testSwap();
testBuildMaxHeap();
testMaxHeapify();
testMerge();
testBubbleSort();
testSelectSort();
testInsertSort();
testMergeSort();
testHeapSort();
return 0;
}
void testBuildMaxHeap() {
int array1[] = {10,20,5};
int array1C[] = {20,10,5};
int array2[] = {6,10,5,3,7};
int array2C[] = {10,7,5,3,6};
printf("Test MaxHeapify\n");
printf("Test 1\n");
assert(memcmp(buildMaxHeap(array1, 3),array1C,sizeof(array1))==0);
printf("Test 2\n");
assert(memcmp(buildMaxHeap(array2, 5),array2C, sizeof(array2))==0);
printf("Tests Passed\n");
}
void testMaxHeapify() {
int array1[] = {10,20,5};
int array1C[] = {20,10,5};
int array2[] = {6,10,5,3,7};
int array2C[] = {10,7,5,3,6};
printf("Test MaxHeapify\n");
printf("Test 1\n");
assert(memcmp(maxHeapify(array1, 3, 0),array1C,sizeof(array1))==0);
printf("Test 2\n");
assert(memcmp(maxHeapify(array2, 5, 0),array2C, sizeof(array2))==0);
printf("Tests Passed\n");
}
void testSwap() {
int array1[]= {1,2,3};
int array2[]= {3,2,1};
int array3[]= {2,3,1};
printf("Test Swap\n");
printf("Test 1\n");
swap(array1,0,2);
assert(memcmp(array1,array2,sizeof(array1))==0);
printf("Test 2\n");
swap(array1,0,1);
assert(memcmp(array1,array3,sizeof(array1))==0);
printf("Tests Passed\n");
}
void testMerge() {
int p;
int q;
int r;
int testA[] = {0,1};
int testB[] = {0,1,3};
int testC[] = {0,1,2,4};
int array1[] = {1,0};
int array2[] = {3,0,1};
int array3[] = {0,2,1,4};
printf("Test merge\n");
printf("Test 1\n");
merge(array1,0,0,2);
assert(memcmp(array1,testA,sizeof(array1))==0);
printf("Test 2\n");
merge(array2,0,0,3);
assert(memcmp(array2,testB,sizeof(array2))==0);
printf("Test 3\n");
merge(array3,0,1,4);
assert(memcmp(array3,testC,sizeof(array3))==0);
printf("Test Passed\n");
}
void testBubbleSort() {
int sortArray1[]={3,5,8,9};
int sortArray2[]={-5,-2,5,10,20};
int sortArray3[]={2,3,5,5};
int disOArray[]={5,9,8,3};
int revOArray[]={9,8,5,3};
int negArray[]={-5,5,10,-2,20};
int repArray[]={5,2,3,5};
printf("Test bubbleSort\n");
printf("Test Disordered Array.\n");
assert(memcmp(bubbleSort(disOArray,4),sortArray1,sizeof(disOArray))==0);
printf("Test Reverse Ordered Array.\n");
assert(memcmp(bubbleSort(revOArray,4),sortArray1,sizeof(revOArray))==0);
printf("Test Negatives in Array.\n");
assert(memcmp(bubbleSort(negArray,5),sortArray2,sizeof(negArray))==0);
printf("Test Empty Array.\n");
assert(bubbleSort(NULL,1)==NULL);
printf("Test Repeats in Array.\n");
assert(memcmp(bubbleSort(repArray,4),sortArray3,sizeof(repArray))==0);
printf("Test Ordered Array.\n");
assert(memcmp(bubbleSort(sortArray1,4),sortArray1,sizeof(sortArray1))==0);
printf("Tests Passed\n");
}
void testSelectSort() {
int sortArray1[]={3,5,8,9};
int sortArray2[]={-5,-2,5,10,20};
int sortArray3[]={2,3,5,5};
int disOArray[]={5,9,8,3};
int revOArray[]={9,8,5,3};
int negArray[]={-5,5,10,-2,20};
int repArray[]={5,2,3,5};
printf("Test selectSort\n");
printf("Test Disordered Array.\n");
assert(memcmp(selectSort(disOArray,4),sortArray1,sizeof(disOArray))==0);
printf("Test Reverse Ordered Array.\n");
assert(memcmp(selectSort(revOArray,4),sortArray1,sizeof(revOArray))==0);
printf("Test Negatives in Array.\n");
assert(memcmp(selectSort(negArray,5),sortArray2,sizeof(negArray))==0);
printf("Test Empty Array.\n");
assert(selectSort(NULL,1)==NULL);
printf("Test Repeats in Array.\n");
assert(memcmp(selectSort(repArray,4),sortArray3,sizeof(repArray))==0);
printf("Test Ordered Array.\n");
assert(memcmp(selectSort(sortArray1,4),sortArray1,sizeof(sortArray1))==0);
printf("Tests Passed\n");
}
void testInsertSort() {
int sortArray1[]={3,5,8,9};
int sortArray2[]={-5,-2,5,10,20};
int sortArray3[]={2,3,5,5};
int disOArray[]={5,9,8,3};
int revOArray[]={9,8,5,3};
int negArray[]={-5,5,10,-2,20};
int repArray[]={5,2,3,5};
printf("Test insertSort\n");
printf("Test Disordered Array.\n");
assert(memcmp(insertSort(disOArray,4),sortArray1,sizeof(disOArray))==0);
printf("Test Reverse Ordered Array.\n");
assert(memcmp(insertSort(revOArray,4),sortArray1,sizeof(revOArray))==0);
printf("Test Negatives in Array.\n");
assert(memcmp(insertSort(negArray,5),sortArray2,sizeof(negArray))==0);
printf("Test Empty Array.\n");
assert(insertSort(NULL,1)==NULL);
printf("Test Repeats in Array.\n");
assert(memcmp(insertSort(repArray,4),sortArray3,sizeof(repArray))==0);
printf("Test Ordered Array.\n");
assert(memcmp(insertSort(sortArray1,4),sortArray1,sizeof(sortArray1))==0);
printf("Tests Passed\n");
}
void testMergeSort() {
int sortArray1[]={3,5,8,9};
int sortArray2[]={-5,-2,5,10,20};
int sortArray3[]={2,3,5,5};
int sortArray4[]={2,3,5,6,10};
int disOArray[]={5,9,8,3};
int revOArray[]={9,8,5,3};
int negArray[]={-5,5,10,-2,20};
int repArray[]={5,2,3,5};
int unevenArray[]={5,3,10,2,6};
printf("Test mergeSort\n");
printf("Test Disordered Array.\n");
assert(memcmp(mergeSort(disOArray,0,4),sortArray1,sizeof(disOArray))==0);
printf("Test Reverse Ordered Array.\n");
assert(memcmp(mergeSort(revOArray,0,4),sortArray1,sizeof(revOArray))==0);
printf("Test Negatives in Array.\n");
assert(memcmp(mergeSort(negArray,0,5),sortArray2,sizeof(negArray))==0);
printf("Test Empty Array.\n");
assert(mergeSort(NULL,0,1)==NULL);
printf("Test Repeats in Array.\n");
assert(memcmp(mergeSort(repArray,0,4),sortArray3,sizeof(repArray))==0);
printf("Test Ordered Array.\n");
assert(memcmp(mergeSort(sortArray1,0,4),sortArray1,sizeof(sortArray1))==0);
printf("Test Uneven Subarray.\n");
assert(memcmp(mergeSort(unevenArray,0,5),sortArray4,sizeof(unevenArray))==0);
printf("Tests Passed\n");
}
void testHeapSort() {
int sortArray1[]={3,5,8,9};
int sortArray2[]={-5,-2,5,10,20};
int sortArray3[]={2,3,5,5};
int sortArray4[]={2,3,5,6,10};
int disOArray[]={5,9,8,3};
int revOArray[]={9,8,5,3};
int negArray[]={-5,5,10,-2,20};
int repArray[]={5,2,3,5};
int unevenArray[]={5,3,10,2,6};
printf("Test heapSort\n");
printf("Test Disordered Array.\n");
assert(memcmp(heapSort(disOArray,4),sortArray1,sizeof(disOArray))==0);
printf("Test Reverse Ordered Array.\n");
assert(memcmp(heapSort(revOArray,4),sortArray1,sizeof(revOArray))==0);
printf("Test Negatives in Array.\n");
assert(memcmp(heapSort(negArray,5),sortArray2,sizeof(negArray))==0);
printf("Test Empty Array.\n");
assert(heapSort(NULL,1)==NULL);
printf("Test Repeats in Array.\n");
assert(memcmp(heapSort(repArray,4),sortArray3,sizeof(repArray))==0);
printf("Test Ordered Array.\n");
assert(memcmp(heapSort(sortArray1,4),sortArray1,sizeof(sortArray1))==0);
printf("Test Uneven Subarray.\n");
assert(memcmp(heapSort(unevenArray,5),sortArray4,sizeof(unevenArray))==0);
printf("Tests Passed\n");
}