[plt-scheme] tree-recursion vs explicit stack tail-recursive

From: Skeptic . (skeptic2000 at hotmail.com)
Date: Thu Apr 22 20:28:55 EDT 2010


I'm curious to know how in PLT what kind of performance difference (in the broad
sense) would be found when comparing a tree-recursive procedure to a
tail-recursive one that use an explicit stack and a non-trivial nested list,
e.g. flatten, count-atoms and the like.


In fact, I'm more interested in the reason
why one would perform better than the other in PLT (or any scheme) than on
actual numbers.



Thanks for any idea/suggestions.
Emmenez vos contacts faire un tour. 

Posted on the users mailing list.