1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
f (n, a) int n; double a[]; { double b[51]; int i, j; i = 0; for (j = n - 1; j > 0; j--) b[i++] = 0; if (b[0] > b[i - 1]) a[i] = b[i - 1]; }