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
|
/* integration/ptsort.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 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 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
static void
sort_results (gsl_integration_workspace * workspace);
static void
sort_results (gsl_integration_workspace * workspace)
{
size_t i;
double * elist = workspace->elist ;
size_t * order = workspace->order ;
size_t nint = workspace->size;
for (i = 0; i < nint; i++)
{
size_t i1 = order[i];
double e1 = elist[i1];
size_t i_max = i1;
size_t j;
for (j = i + 1; j < nint; j++)
{
size_t i2 = order[j];
double e2 = elist[i2];
if (e2 >= e1)
{
i_max = i2;
e1 = e2;
}
}
if (i_max != i1)
{
order[i] = order[i_max];
order[i_max] = i1;
}
}
workspace->i = order[0] ;
}
|
