Function that calculates in compile time when it can
Russel Winder
russel at winder.org.uk
Mon Aug 6 11:37:11 PDT 2012
On Mon, 2012-08-06 at 17:21 +0200, Philippe Sigaud wrote:
[…]
> Well, you're using the worst possible algorithm to calculate Fibonacci
> (exponential time), so it's no wonder it's taking foverer :)
Memoization is a bit of a help it destroying that problem.
[…]
> Don't try fib(100) at runtime!
Of course the real problem is that quants and such folk often need
values of Fibonacci and factorial that cannot be held in an hardware
integer.
--
Russel.
=============================================================================
Dr Russel Winder t: +44 20 7585 2200 voip: sip:russel.winder at ekiga.net
41 Buckmaster Road m: +44 7770 465 077 xmpp: russel at winder.org.uk
London SW11 1EN, UK w: www.russel.org.uk skype: russel_winder
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part
URL: <http://lists.puremagic.com/pipermail/digitalmars-d-learn/attachments/20120806/a85d8f68/attachment.pgp>
More information about the Digitalmars-d-learn
mailing list