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
|
/*
igraph library.
Copyright (C) 2024 The igraph development team <igraph@igraph.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <igraph.h>
#include "bench.h"
/* This program benchmarks igraph_qsort() indirectly through vector_sort() */
int main(void) {
igraph_vector_int_t vec;
igraph_rng_seed(igraph_rng_default(), 137);
BENCH_INIT();
igraph_vector_int_init(&vec, 0);
#define N 10000000
igraph_vector_int_resize(&vec, N);
for (igraph_int_t i=0; i < N; i++) {
VECTOR(vec)[i] = RNG_INTEGER(0, N-1);
}
BENCH("Sort vector of length " IGRAPH_I_STRINGIFY(N), igraph_vector_int_sort(&vec));
#undef N
#define N 1000000
igraph_vector_int_resize(&vec, N);
for (igraph_int_t i=0; i < N; i++) {
VECTOR(vec)[i] = RNG_INTEGER(0, N-1);
}
BENCH("Sort vector of length " IGRAPH_I_STRINGIFY(N), igraph_vector_int_sort(&vec));
#undef N
#define N 100000
igraph_vector_int_resize(&vec, N);
for (igraph_int_t i=0; i < N; i++) {
VECTOR(vec)[i] = RNG_INTEGER(0, N-1);
}
BENCH("Sort vector of length " IGRAPH_I_STRINGIFY(N), igraph_vector_int_sort(&vec));
igraph_vector_int_destroy(&vec);
return 0;
}
|
