blob: d996df2dd34c969eb937ba4ba7f9023d4e91e8f3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
#include "sort.c"
#include <assert.h>
#include <stdio.h>
int main() {
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]);
}
printf("[PASS] sort\n");
}
|