Re: Fibonacci series recursion error

Path	csiph.com!x330-a1.tempe.blueboxinc.net!aioe.org!goblin2!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 12:01:50 +0100
Organization	University of Bergen
Lines	16
Message-ID	<up6t88-4p7.ln1@svn.schaathun.net> (permalink)
References	<a78a0ffd-03cc-4540-addb-b8e206d165d5@n2g2000prj.googlegroups.com> <KtMup.29280$8U5.7734@newsfe20.iad> <87iptw1egh.fsf@rudin.co.uk>
NNTP-Posting-Host	vannskorpion.bccs.uib.no
X-Trace	toralf.uib.no 1304161082 50258 129.177.20.20 (30 Apr 2011 10:58:02 GMT)
X-Complaints-To	abuse@uib.no
NNTP-Posting-Date	30 Apr 2011 10:58:02 GMT
User-Agent	slrn/pre1.0.0-18 (Linux)
Xref	x330-a1.tempe.blueboxinc.net comp.lang.python:4183

Show key headers only | View raw

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.


-- 
:-- Hans Georg

Back to comp.lang.python | Previous | Next — 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