Subject: Re: [xsl] Recursion performance (fibonacci numbers) From: Mukul Gandhi <gandhi.mukul@xxxxxxxxx> Date: Mon, 16 Jan 2006 22:09:05 +0530 |
Thanks David. This is really fast. Regards, Mukul On 1/16/06, David Carlisle <davidc@xxxxxxxxx> wrote: > > Dimitre asked a similar question a while back: > > http://www.xslt.com/html/xsl-list/2005-06/msg00844.html > > at least, the first part of his question involved calculating fibonacci > numbers efficiently. I'm not sure he ever published the results that > people sent him. > > For fibonacci, I suggested: > > <xsl:function name="x:fib" as="xs:integer"> > <xsl:param name="n" as="xs:integer"/> > <xsl:choose> > <xsl:when test="$n=0"> > <xsl:sequence select="1"/> > </xsl:when> > <xsl:when test="$n =1"> > <xsl:sequence select="1"/> > </xsl:when> > <xsl:when test="$n mod 2 = 0"> > <xsl:variable name="n2" select="$n idiv 2"/> > <xsl:variable name="fn" select="x:fib($n2)"/> > <xsl:variable name="fn-1" select="x:fib($n2 -1)"/> > <xsl:sequence select="$fn * $fn + $fn-1 * $fn-1"/> > </xsl:when> > <xsl:when test="$n mod 2 = 1"> > <xsl:variable name="n2" select="($n - 1) idiv 2"/> > <xsl:variable name="fn" select="x:fib($n2)"/> > <xsl:variable name="fn-1" select="x:fib($n2 -1)"/> > <xsl:sequence select="(2 * $fn-1 + $fn) * $fn"/> > </xsl:when> > </xsl:choose> > </xsl:function> > > which should I think me considerably quicker than the function that you > suggested for large numbers. > > > David
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Recursion performance (fi, David Carlisle | Thread | Re: [xsl] Recursion performance (fi, Dimitre Novatchev |
Re: [xsl] keeping text together in , Nadia . Swaby | Date | RE: [xsl] Accessing a node dynamica, Florent Georges |
Month |