| 1 |
procedure main () |
| 2 |
every n := 1 to 10 do { |
| 3 |
write (n, "! = ", memoized_factorial ( n ) ); |
| 4 |
} |
| 5 |
n := 135; write(n, "! = ", memoized_factorial ( n ) ); |
| 6 |
n := 155; write(n, "! = ", memoized_factorial ( n ) ); |
| 7 |
end |
| 8 |
procedure memoized_factorial ( k ) |
| 9 |
static results; |
| 10 |
static k_limit; |
| 11 |
static k_old; |
| 12 |
initial { |
| 13 |
results := [1]; |
| 14 |
k_limit := 10 ^ 5; |
| 15 |
k_old := 1; |
| 16 |
} |
| 17 |
if (k < k_limit) then { |
| 18 |
while (k > *results) do results := results ||| list(*results) |
| 19 |
every n := (k_old + 1) to k do { |
| 20 |
results[n] := n * results[n - 1]; |
| 21 |
} |
| 22 |
k_old := k; |
| 23 |
return results[k]; |
| 24 |
} else { |
| 25 |
return ((k / &e) ^ n) * sqrt(2 * &pi * n); |
| 26 |
} |
| 27 |
end |