Algorithm 36: tchebycheff
Agustin Gianni · Communications of the ACM · 1961
procedure Sieve (Nmax) Primes: (p) ; integer Nmax; integer array p ; comment Sieve uses the Sieve of Eratosthenes to find all prime numbers not greater than a stated integer Nmax and stores them in array p.This array should be of dimension 1 by entier (2 X Nmax/t~n (Nmax)) ; begin integer n, i, j ; p[1] := 1 ; p[2]:= 2 ; p[3] := j := 3 ; for n := 3 step 2 until Nmax do begin i := 3 ; LI: go to if p[i] < sqrt (n) then al else a2 ; al: go to if n/p[i] = n + p[i] then bl else b2 ; b2:i := i + 1 ; go toLl ; a2 :p[j] := n ; j := j +1 ; bl: end end ALGORITHM 36 TCHEBYCHEFF A. J. GIANNI RCA Digital Computation and Sinmlation Group, Moorestown, New Jersey procedure tchebycheff (t, x, m, ~) ; real array t, x ; integer ~,m ; comment given a set of m+l values of x stored in a onedimensional array whose subscripts run from 0 thrum at least, construct a table of t.(X), n = 0, 1,...,C and store it in the two-dimensional array t, where you find t~(x[m]) as t[n, m] ; begin integer i, k, n ; for k := 0 step 1 until in do begin t[0, k] := 1 ; t[1, k] := x[k] end ; for n := 2 step I until ~ do for i = 0 step 1 until m do t[n, i] := 2 X x[i] X t[n -1, i]--t[n --2, i] end tcheby ALGORITHM 37 TELESCOPE 1