Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.python > #4196

Re: Fibonacci series recursion error

From Paul Rudin <paul.nospam@rudin.co.uk>
Newsgroups comp.lang.python
Subject Re: Fibonacci series recursion error
Date 2011-04-30 12:29 +0100
Message-ID <87ei4k0ygz.fsf@rudin.co.uk> (permalink)
References <a78a0ffd-03cc-4540-addb-b8e206d165d5@n2g2000prj.googlegroups.com> <KtMup.29280$8U5.7734@newsfe20.iad> <87iptw1egh.fsf@rudin.co.uk> <up6t88-4p7.ln1@svn.schaathun.net>

Show all headers | View raw


Hans Georg Schaathun <hg@schaathun.net> writes:

> On Sat, 30 Apr 2011 06:43:42 +0100, Paul Rudin
>   <paul.nospam@rudin.co.uk> wrote:
> :  Writing recurive code is acceptable and is a nice clear way of
> :  expressing things when you have naturally recursive data structures, and
> :  can lead to perfectly good compiled code. The problem in CPython is the
> :  lack of tail optimization, so it's not a good idea for python . Some
> :  language standards guarantee tail optimization...
>
> Well, if you run into a case where tail optimisation really makes a
> difference, you probably want to reimplement it for a compiler that
> guarantees tail optimisation, rather than reimplement it without
> recursion within python.

Clearly it makes a difference in any case where you'd hit the recursion
limit. It's no big deal to do your own unwinding of the recursion to a
loop, but the code is typically less clear.

Back to comp.lang.python | Previous | NextPrevious in thread | Next in thread | Find similar


Thread

Re: Fibonacci series recursion error Hans Georg Schaathun <hg@schaathun.net> - 2011-04-30 12:01 +0100
  Re: Fibonacci series recursion error Paul Rudin <paul.nospam@rudin.co.uk> - 2011-04-30 12:29 +0100
    Re: Fibonacci series recursion error Hans Georg Schaathun <hg@schaathun.net> - 2011-04-30 14:21 +0100

csiph-web