[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[gforth] naive fibonacci
From: |
Terrence Brannon |
Subject: |
[gforth] naive fibonacci |
Date: |
Sat, 6 Mar 2010 21:04:44 -0500 |
I [found](http://bit.ly/ar7uDi) a couple of naive fibonacci programs
by Bill Spight that work:
: FIB ?DUP
CASE
0 of 1 endof
1 of 1- RECURSE 1 endof
1- RECURSE TUCK +
ENDCASE ;
: FIB DUP 0= IF 1 ELSE 1- RECURSE TUCK + THEN ;
But I would like to know why mine does not work:
: fib { n -- fibn }
assert( n 0>= )
n CASE
0 OF 0 ENDOF
1 OF 1 ENDOF
2 OF 1 ENDOF
( otherwise ) n 1 - recurse n 2 - recurse +
ENDCASE ;
- [gforth] naive fibonacci,
Terrence Brannon <=
- RE: [gforth] naive fibonacci, Dennis Ruffer, 2010/03/06
- Re: [gforth] naive fibonacci, Elko Tchernev, 2010/03/06
- Re: [gforth] naive fibonacci, Terrence Brannon, 2010/03/07
- Re: [gforth] naive fibonacci, Elko Tchernev, 2010/03/07
- RE: [gforth] naive fibonacci, Dennis Ruffer, 2010/03/07
- Re: [gforth] List strangeness, Elko Tchernev, 2010/03/07
- RE: [gforth] List strangeness, Dennis Ruffer, 2010/03/07
- Re: [gforth] List strangeness, Anton Ertl, 2010/03/08
- Re: [gforth] List strangeness, Elko Tchernev, 2010/03/08