/* nag_monotonic_deriv(e01bgc) Example Program * * Copyright 1991 Numerical Algorithms Group. * * Mark 2, 1991. */ #include #include #include #include #define MMAX 21 #define NMAX 50 int main(void) { Integer i, m, n, r; double x[NMAX], pd[MMAX], pf[MMAX], px[MMAX], f[NMAX], d[NMAX], step; Vprintf("e01bgc Example Program Results\n"); Vscanf("%*[^\n]"); /* Skip heading in data file */ Vscanf("%ld",&n); if (n>0 && n<=NMAX) { for (r=0; r0 && 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