[XSL-LIST Mailing List Archive Home]
[By Thread]
[By Date]
[xsl] Fibonacci & XSL
Subject: [xsl] Fibonacci & XSL From: "Kasper Nielsen" <news@xxxxxx> Date: Tue, 17 Dec 2002 12:19:04 +0100 |
This is actually more a question of dynamic programming in XSL. If you can't remember the function it is: F0 = 0 F1 = 1 f(n)=f(n-1)+f(n-2) for n>=2 is it possible to make a template that calculates this in linear time (I know it can be done in O(lg n) but linear is enogh) in xsl? The straightforward recursive method for calculating f(n) is clearly exponential in n. If it is possible I would prefer an example using memoization because I need it to a similar problem I have. regards Kasper XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: [xsl] Extending Xhtml2fo.xsl to, Graham Hannington | Thread | Re: [xsl] Fibonacci & XSL, Eric van der Vlist |
Re[2]: [xsl] get back from nodeset , Heiko Specht | Date | Re: [xsl] xsl transform question, Jeni Tennison |
Month |