Re: Fabonicseries Program required
- From: "Chris Uppal" <chris.uppal@xxxxxxxxxxxxxxxxxxxxxxxxxxx>
- Date: Tue, 7 Nov 2006 15:27:22 -0000
Eric Sosman wrote:
fib(100000) is a 69424-bit number, and adding numbers of
that size is likely to take more than "no time."
Still, the iterative solution beats the pants off recursion.
On my machine the iterative form takes ~ 0.024 seconds for fib(10,000). The
memoised recursive form takes around 0.09 seconds.
Not really a trouser-ripping difference in speed. What matters more is that
the recursive form blows the default stack at around fib(8,000), and the
default heap somewhere before fib(40,000).
I assume that the increased GC load of the memoised version explains the
difference in speeds -- which otherwise seems implausibly great (the BigInteger
adds should /swamp/ the array accesses and null-tests).
-- chris
.
- Follow-Ups:
- Re: Fabonicseries Program required
- From: Chris Uppal
- Re: Fabonicseries Program required
- References:
- Fabonicseries Program required
- From: sirusha
- Re: Fabonicseries Program required
- From: hiwa
- Re: Fabonicseries Program required
- From: sirusha
- Re: Fabonicseries Program required
- From: Furious George
- Re: Fabonicseries Program required
- From: John W. Kennedy
- Re: Fabonicseries Program required
- From: Mike
- Re: Fabonicseries Program required
- From: Martin Weiss
- Re: Fabonicseries Program required
- From: JanTheKing
- Re: Fabonicseries Program required
- From: Karl Uppiano
- Re: Fabonicseries Program required
- From: JanTheKing
- Re: Fabonicseries Program required
- From: Karl Uppiano
- Re: Fabonicseries Program required
- From: Ingo Menger
- Re: Fabonicseries Program required
- From: Eric Sosman
- Fabonicseries Program required
- Prev by Date: Re: Limit uploaded image file dimensions
- Next by Date: Re: Problems binding to LDAP
- Previous by thread: Re: Fabonicseries Program required
- Next by thread: Re: Fabonicseries Program required
- Index(es):
Relevant Pages
|