/* nag_monotonic_interpolant(e01bec) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group
 *
 * Mark 2 revised, 1992.
 */

#include <nag.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nage01.h>

#define MMAX 50
#define NMAX 50

int main(void)
{
  Integer i, m, n, r;
  double step, d[NMAX], f[NMAX], pf[MMAX], px[MMAX], x[NMAX];
  static NagError fail;

  fail.print = TRUE;
  Vprintf("e01bec Example Program Results\n");
  Vscanf("%*[^\n]"); /* Skip to end of line */
  Vscanf("%ld",&n);
  if (n>=1 && n<NMAX)
    {
      for (r = 0; r < n; r++)
        Vscanf("%lf%lf",&x[r],&f[r]);
      /* Abort on error in e01bec */
      e01bec(n, x, f, d, NAGERR_DEFAULT);
      Vscanf("%ld",&m);
      if (m>=1 && m<MMAX)
        {
          /* Compute M equally spaced points from x[0] to x[n-1]. */
          step = (x[n-1] - x[0]) / (double)(m-1);
          for (i = 0; i < m; i++)
            px[i] = MIN(x[0]+ i*step,x[n-1]);
          e01bfc(n, x, f, d, m, px, pf, &fail);
          Vprintf("                 Interpolated\n");
          Vprintf("      Abscissa      Value\n");
          for (i = 0; i < m; i++)
            Vprintf("%13.4f%13.4f\n", px[i], pf[i]);
        }
      return EXIT_SUCCESS;
    }
  else
    {
      Vfprintf(stderr, "n is out of range: n = %5ld\n", n);
      return EXIT_FAILURE;
    }
}