🚀 go-pugleaf

In article <1854@mtgzz.UUCP> bds@mtgzz.UUCP (b.d.szablak) writes:
>
>	I would appreciate it if someone well versed in forth programming
>could give this novice hints on coding recursive algorthims (the two Forth
>texts I have manage to avoid this topic). It seems the very first word that
>I (in all innocence) attempted to define was to evaluate the fibinocci
>function (in C):
>
>	fib(n)
>	{
>		if( n==1 || n==2 ) return 1;
>		return fib(n-1) + fib(n-2);
>	}
>

I recognize the Fibbonacci series here but I don't remember any deffinition
that gave a single number for it!  Anyway here is the FORTH code:

: fib ( n ) DUP 3 < IF  DROP 1  ( return 1 for 1 or 2, assumes n>=1  )
                    ELSE  [ SMUDGE ]  ( allow for recursion )
                        DUP 1- fib    ( here is your fib{n-1}  )
                        SWAP 2- fib   ( followed by  fib{n-2}  )
                        +  [ SMUDGE ] ( sum two fib s, end recursability )
                    THEN  ;

For arguments of n=  1   2   3   4   5   6   7   8
this gives results=  1   1   2   3   5   8  12  21

I don't know if this is quite what you wanted, but the RECURSION works fine!

Best wishes in exploring FORTH!


-- 

    ihnp4------\                  Jim Luscher
  harvard-\     \                 Nicolet Instruments / Test Instrument Div
     seismo!uwvax!nicmad!luscher  5225 Verona Rd. Bldg-2
    topaz-/     /                 Madison, Wi  53711-0288
   decvax------/                  (608) 271-3333 x 2274