3 : SUM.OF.N.A ( N -- SUM[N] , calculate sum of N integers )
\r
4 0 \ starting value of SUM
\r
6 OVER 0> \ Is N greater than zero?
\r
8 OVER + \ add N to sum
\r
9 SWAP 1- SWAP \ decrement N
\r
11 SWAP DROP \ get rid on N
\r
14 : SUM.OF.N.B ( N -- SUM[N] )
\r
15 0 SWAP \ starting value of SUM
\r
16 1+ 0 \ set indices for DO LOOP
\r
17 ?DO \ safer than DO if N=0
\r
22 : SUM.OF.N.C ( N -- SUM[N] )
\r
23 0 \ starting value of SUM
\r
32 : SUM.OF.N.D ( N -- SUM[N] )
\r
33 >R \ put NUM on return stack
\r
34 0 \ starting value of SUM
\r
36 R@ + \ add num to sum
\r
40 RDROP \ get rid of NUM
\r
43 : SUM.OF.N.E { NUM | SUM -- SUM[N] , use return stack }
\r
45 NUM +-> SUM \ add NUM to SUM
\r
46 -1 +-> NUM \ decrement NUM
\r
52 : SUM.OF.N.F ( NUM -- SUM[N] , Gauss' method )
\r