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
|
#include "sort.c"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int compareInts(const void *a, const void *b) {
int arg1 = *(const int *)a;
int arg2 = *(const int *)b;
return (arg1 > arg2) - (arg1 < arg2);
}
void rand_test(int n) {
int *arr1 = malloc(sizeof(int) * n);
int *arr2 = malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
int val = rand();
arr1[i] = val;
arr2[i] = val;
}
qsort(arr1, n, sizeof(int), compareInts);
Int_qsort(arr2, n);
for (int i = 0; i < n; i++) {
assert(arr1[i] == arr2[i]);
}
free(arr1);
free(arr2);
}
int main() {
srand(time(NULL));
printf("[TEST] sort\n");
int arr[] = {2,4,5,7,4,6,7,8,8,5,4};
int arrlen = sizeof(arr) / sizeof(int);
Int_qsort(arr, arrlen);
for (int i = 0; i < arrlen - 1; i++) {
assert(arr[i] <= arr[i+1]);
}
Int_qsort(arr, arrlen);
for (int i = 0; i < arrlen - 1; i++) {
assert(arr[i] <= arr[i+1]);
}
for (int i = 0; i < 10; i++) {
rand_test(rand() % 10000);
}
printf("[PASS] sort\n");
}
|
