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
|
/* sort/test_heapsort.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Thomas Walter, Brian Gough
*
* 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 3 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
int cmp_dbl (const void *a, const void *b);
void test_heapsort (size_t N);
void initialize (double *data, size_t N);
void cpy (double *dest, double *src, size_t N);
void randomize (double *data, size_t n);
void reverse (double *data, size_t N);
int check (double *data, double *orig, size_t N);
int pcheck (size_t * p, double *data, double *orig, size_t N);
void
test_heapsort (size_t N)
{
int status;
double *orig = (double *) malloc (N * sizeof (double));
double *data = (double *) malloc (N * sizeof (double));
size_t *p = (size_t *) malloc (N * sizeof(size_t));
initialize (orig, N);
/* Already sorted */
cpy (data, orig, N);
status = gsl_heapsort_index (p, data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status |= pcheck (p, data, orig, N);
gsl_test (status, "indexing array, n = %u, ordered", N);
gsl_heapsort (data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status = check (data, orig, N);
gsl_test (status, "sorting, array, n = %u, ordered", N);
/* Reverse the data */
cpy (data, orig, N);
reverse (data, N);
status = gsl_heapsort_index (p, data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status |= pcheck (p, data, orig, N);
gsl_test (status, "indexing array, n = %u, reversed", N);
gsl_heapsort (data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status = check (data, orig, N);
gsl_test (status, "sorting, array, n = %u, reversed", N);
/* Perform some shuffling */
cpy (data, orig, N);
randomize (data, N);
status = gsl_heapsort_index (p, data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status |= pcheck (p, data, orig, N);
gsl_test (status, "indexing array, n = %u, randomized", N);
gsl_heapsort (data, N, sizeof (double), (gsl_comparison_fn_t) & cmp_dbl);
status = check (data, orig, N);
gsl_test (status, "sorting, array, n = %u, randomized", N);
free (orig);
free (data);
free (p);
}
void
initialize (double *data, size_t N)
{
size_t i;
for (i = 0; i < N; i++)
{
data[i] = i;
}
}
void
cpy (double *dest, double *src, size_t N)
{
size_t i;
for (i = 0; i < N; i++)
{
dest[i] = src[i];
}
}
void
randomize (double *data, size_t N)
{
size_t i;
for (i = 0; i < N; i++)
{
size_t j = urand (N);
double tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
void
reverse (double *data, size_t N)
{
size_t i;
for (i = 0; i < N / 2; i++)
{
size_t j = N - i - 1;
{
double tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
int
check (double *data, double *orig, size_t N)
{
size_t i;
for (i = 0; i < N; i++)
{
if (data[i] != orig[i])
{
return GSL_FAILURE;
}
}
return GSL_SUCCESS;
}
int
pcheck (size_t * p, double *data, double *orig, size_t N)
{
size_t i;
for (i = 0; i < N; i++)
{
if (data[p[i]] != orig[i])
{
return GSL_FAILURE;
}
}
return GSL_SUCCESS;
}
int
cmp_dbl (const void *a, const void *b)
{
const double x = *(const double *) a;
const double y = *(const double *) b;
if (x > y)
return 1;
if (x == y)
return 0;
else
return -1;
}
|
