/* nag_stable_sort(m01ctc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 2 revised, 1992.
 * Mark 7 revised, 2001.
 *
 */

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


#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

#define MMAX 20
#define NMAX 20

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

  fail.print = TRUE;
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vprintf("m01ctc Example Program Results\n");
  Vscanf("%ld%ld%ld", &m, &n, &k);
  if (m>=0 && m<=MMAX && n>=0 && n<=NMAX && k>=0 && k<=n)
    {
      for (i=0; i<m; ++i)
        for (j=0; j<n; ++j)
          Vscanf("%lf",&vec[i][j]);
      m01ctc((Pointer) &vec[0][k-1], (size_t) m, sizeof(double),
             (ptrdiff_t)(NMAX*sizeof(double)), compare,  Nag_Ascending, &fail);
      if (fail.code != NE_NOERROR)
        return EXIT_FAILURE;
      Vprintf("\nMatrix with column %ld sorted\n", k);
      for (i=0; i<m; ++i)
        {
          for (j=0; j<n; ++j)
            Vprintf(" %7.1f ", vec[i][j]);
          Vprintf("\n");
        }
      return EXIT_SUCCESS;
    }
  else
    {
      Vfprintf(stderr, "Data error: program terminated\n");
      return EXIT_FAILURE;
    }
}