/* nag_ftt_2d_complex(c06fuc) Example Program * * Copyright 1990 Numerical Algorithms Group. * * Mark 2 revised, 1992. */ #include #include #include #include #define MMAX 6 #define NMAX 6 #define MNMAX MMAX*NMAX int main(void) { Integer i, j, m, n; double trigm[2*MMAX], trign[2*NMAX]; double x[MNMAX], y[MNMAX]; Vprintf("c06fuc Example Program Results\n"); /* Skip heading in data file */ Vscanf("%*[^\n]"); while (scanf("%ld%ld", &m, &n)!=EOF) if (m*n>=1 && m*n<=MNMAX) { Vprintf("\n\nm = %2ld n = %2ld\n", m, n); /* Read in complex data and print out. */ for (j = 0; j