/* nag_double_sort(m01cac) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 1, 1990.
 */

#include <nag.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nag_stddef.h>
#include <nagm01.h>

#define NMAX 50

int main(void)
{
  double vec[NMAX];
  Integer i, n;
  static NagError fail;

  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vprintf("m01cac Example Program Results\n");
  Vscanf("%ld",&n);
  if (n<0 || n>NMAX)
    {
      Vfprintf(stderr, "n is out of range: n = %5ld\n", n);
      return EXIT_FAILURE;
    }
  for (i=0; i<n; ++i)
    Vscanf("%lf",&vec[i]);
  fail.print = TRUE;
  m01cac(vec, (size_t) n, Nag_Ascending, &fail);
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("Sorted numbers\n\n");
  for (i=0; i<n; ++i)
    Vprintf("%10.6g%c",vec[i],(i%7==6 || i==n-1) ? '\n' : ' ');
  return EXIT_SUCCESS;
}