Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!goblin3!goblin.stu.neva.ru!newsfeed3.funet.fi!newsfeeds.funet.fi!uio.no!nntp.uib.no!svn.schaathun.net!not-for-mail
From: Hans Georg Schaathun <hg@schaathun.net>
Newsgroups: comp.lang.python
Subject: Re: Fibonacci series recursion error
Date: Sat, 30 Apr 2011 14:21:26 +0100
Organization: University of Bergen
Lines: 17
Message-ID: <mvet88-018.ln1@svn.schaathun.net>
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> <87ei4k0ygz.fsf@rudin.co.uk>
NNTP-Posting-Host: vannskorpion.bccs.uib.no
X-Trace: toralf.uib.no 1304171881 54738 129.177.20.20 (30 Apr 2011 13:58:01 GMT)
X-Complaints-To: abuse@uib.no
NNTP-Posting-Date: 30 Apr 2011 13:58:01 GMT
User-Agent: slrn/pre1.0.0-18 (Linux)
Xref: x330-a1.tempe.blueboxinc.net comp.lang.python:4359

On Sat, 30 Apr 2011 12:29:00 +0100, Paul Rudin
  <paul.nospam@rudin.co.uk> wrote:
:  Clearly it makes a difference in any case where you'd hit the recursion
:  limit.

What kind of problems make you hit the limit?

Other than when you forget the base case, I mean.

:          It's no big deal to do your own unwinding of the recursion to a
:  loop, but the code is typically less clear.

Sure.  And you have to live with your less clear code when you maintain
the system later.

-- 
:-- Hans Georg