/* nag_rank_sort(m01dsc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 4, 1996.
 * Mark 5 revised, 1998.
 * Mark 7 revised, 2001.
 *
 */

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

#define N_MAX 50


#ifdef __cplusplus
extern "C"
{
#endif
static Integer NAG_CALL compare(const Nag_Pointer a, const Nag_Pointer b)
{
  double x = *((const double *)a);
  double y = *((const double *)b);
  return (x<y ? -1 : (x==y ? 0 : 1));
}
#ifdef __cplusplus
}
#endif

int main(void)
{
  double vec[N_MAX];
  ptrdiff_t step;
  size_t i, n, rank[N_MAX];
  static NagError fail;

  fail.print = TRUE;
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vprintf("m01dsc Example Program Results\n\n");
  Vscanf("%lu%ld", &n, &step);
  if (n>=0 && step!=0)
    {
      for (i=0; i<n; ++i)
        Vscanf("%lf", &vec[i]);
      m01dsc((Pointer) vec, n, step*(ptrdiff_t)(sizeof(double)), compare,
             Nag_Ascending, rank, &fail);
      if (fail.code != NE_NOERROR)
        return EXIT_FAILURE;
      Vprintf("    Data      Rank\n");
      for (i=0; i<n; ++i)
        Vprintf("   %7.4f   %4ld\n", vec[i], rank[i]);
      return EXIT_SUCCESS;
    }
  else
    {
      Vfprintf(stderr, "Data error: program terminated.\n");
      return EXIT_FAILURE;
    }
}