In article <[EMAIL PROTECTED]>, Paul Rubin <http://[EMAIL PROTECTED]> wrote: > >Every serious FP language implementation optimizes tail calls and thus >using recursion instead of iteration doesn't cost any stack space and >it probably generates the exact same machine code.
While that's true, one of the reasons Guido has historically rejected this optimization is because there are plenty of recursive algorithms not amenable to tail-call optimization. -- Aahz ([EMAIL PROTECTED]) <*> http://www.pythoncraft.com/ The way to build large Python applications is to componentize and loosely-couple the hell out of everything. -- http://mail.python.org/mailman/listinfo/python-list
