On Tue, 2012-07-24 at 16:59 +0200, Simen Kjaeraas wrote:
[…]
> ...which inspired me to write this implementation of fibonacci:
>
> T fib(T = int)(int n, T a = 0, T b = 1) {
> while ( n-- ) {
> TypeTuple!(a,b) = tuple(b, a +b);
> }
> return a;
> }
Or possibly better:
long fibonacci ( immutable long n ) {
return array ( takeExactly ( recurrence ! ( "a[n-1] + a[n-2]" ) ( 0L , 1L ) ,
cast ( size_t ) ( n + 1 ) ) ) [ n ] ;
}
?
--
Russel.
=============================================================================
Dr Russel Winder t: +44 20 7585 2200 voip: sip:russel.win...@ekiga.net
41 Buckmaster Road m: +44 7770 465 077 xmpp: rus...@winder.org.uk
London SW11 1EN, UK w: www.russel.org.uk skype: russel_winder
signature.asc
Description: This is a digitally signed message part
