gsl_integration__ptsort.c 1.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
  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. static void
  20. sort_results (gsl_integration_workspace * workspace);
  21. static void
  22. sort_results (gsl_integration_workspace * workspace)
  23. {
  24. size_t i;
  25. double * elist = workspace->elist ;
  26. size_t * order = workspace->order ;
  27. size_t nint = workspace->size;
  28. for (i = 0; i < nint; i++)
  29. {
  30. size_t i1 = order[i];
  31. double e1 = elist[i1];
  32. size_t i_max = i1;
  33. size_t j;
  34. for (j = i + 1; j < nint; j++)
  35. {
  36. size_t i2 = order[j];
  37. double e2 = elist[i2];
  38. if (e2 >= e1)
  39. {
  40. i_max = i2;
  41. e1 = e2;
  42. }
  43. }
  44. if (i_max != i1)
  45. {
  46. order[i] = order[i_max];
  47. order[i_max] = i1;
  48. }
  49. }
  50. workspace->i = order[0] ;
  51. }