recursion - iteration - generator

Started by Lutz, June 04, 2006, 07:02:10 AM

Previous topic - Next topic

Lutz

A new entry on the http://newlisp.org/index.cgi?Tips_and_Tricks">http://newlisp.org/index.cgi?Tips_and_Tricks page comparing 3 solutions to recursive problems.



Lutz

rickyboy

#1
Nice, but 'fibr' and 'fib' are not doing the same thing.  'fibr' returns the nth Fibonacci number and 'fib' returns a partial Fibonacci sequence.



Also, as you well know, one can write a "memoized" version of the recursive function using the idea you incorporated in the generator version.



I like the idea of comparing methods for doing such things, so thank you very much for writing that.
(λx. x x) (λx. x x)

aron

#2
Thanks, i like those, starting to learn these thing now I think.



;; javascript: for(i=0,j=1,k=0,fib=1; i<10; i++,fib=j+k,k=j,j=fib) document.write(fib + " ");
newLISP browser: (print (replace \"<[^>]*>\" (get-url (read-line)) \"\" 0))