1 /* integration/ptsort.c
2 *
3 * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Brian Gough
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or (at
8 * your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
18 */
19
20 static void
21 sort_results (gsl_integration_workspace * workspace);
22
23 static void
sort_results(gsl_integration_workspace * workspace)24 sort_results (gsl_integration_workspace * workspace)
25 {
26 size_t i;
27
28 double * elist = workspace->elist ;
29 size_t * order = workspace->order ;
30
31 size_t nint = workspace->size;
32
33 for (i = 0; i < nint; i++)
34 {
35 size_t i1 = order[i];
36 double e1 = elist[i1];
37 size_t i_max = i1;
38 size_t j;
39
40 for (j = i + 1; j < nint; j++)
41 {
42 size_t i2 = order[j];
43 double e2 = elist[i2];
44
45 if (e2 >= e1)
46 {
47 i_max = i2;
48 e1 = e2;
49 }
50 }
51
52 if (i_max != i1)
53 {
54 order[i] = order[i_max];
55 order[i_max] = i1;
56 }
57 }
58
59 workspace->i = order[0] ;
60 }
61
62
63