Trabb Pardo–Knuth algorithm: Difference between revisions
→{{header|GW-BASIC}}: Added.
No edit summary |
(→{{header|GW-BASIC}}: Added.) |
||
Line 514:
=={{header|BASIC}}==
=== {{header|GW-BASIC}} ===
{{trans|Commodore BASIC}}
{{works with|BASICA}}
<syntaxhighlight lang="gwbasic">
10 REM Trabb Pardo-Knuth algorithm
20 REM Used "magic numbers" because of strict specification of the algorithm.
30 DEF FNF(N) = SQR(ABS(N)) + 5 * N * N * N
40 DIM S(10)
50 PRINT "Enter 11 numbers."
60 FOR I% = 0 TO 10
70 PRINT STR$(I%+1);
80 INPUT S(I%)
90 NEXT I%
100 PRINT
110 REM Reverse
120 FOR I% = 0 TO 10 \ 2
130 TMP = S(I%): S(I%) = S(10 - I%): S(10 - I%) = TMP
160 NEXT I%
170 REM Results
180 FOR I% = 0 TO 10
190 PRINT "f(";STR$(S(I%));") =";
220 R = FNF(S(I%))
230 IF R > 400 THEN PRINT " overflow" ELSE PRINT R
240 NEXT I%
250 END
</syntaxhighlight>
{{out}}
<pre>
Enter 11 numbers.
1? -5
2? -3
3? -2
4? -1
5? 0
6? 1
7? 2
8? 3
9? 4
10? 5
11? 6
f( 6) = overflow
f( 5) = overflow
f( 4) = 322
f( 3) = 136.7321
f( 2) = 41.41422
f( 1) = 6
f( 0) = 0
f(-1) =-4
f(-2) =-38.58579
f(-3) =-133.268
f(-5) =-622.764
</pre>
==={{header|Minimal BASIC}}===
{{works with|QBasic}}
| |||