[xsl] Re: Simple problem - complicated solution - performance

Subject: [xsl] Re: Simple problem - complicated solution - performance
From: Dimitre Novatchev <dnovatchev@xxxxxxxxx>
Date: Thu, 16 May 2002 22:35:08 -0700 (PDT)

The performance will remain linear if a DVC algorithm is used.

Read about DVC algorithms and their optimisation at:




Many functions in FXSL have their DVC implementation.

Dimitre Novatchev.

"Stuart Celarier" <stuart at ferncrk dot com> wrote:

Dimitre raises an interesting point about using recursion for computing
the minimum and maximum values of a set of data. Let me throw this
question back out to the list, especially to people with XSLT
implementation experience: 

It seems like there must be some practical limits to recursion since
that would involve a call stack in memory. Is it reasonable to think
about recursion that stacks up a couple of thousand or tens of
of calls deep? Taking a page fault on a call stack seems like it could
get very expensive very quickly.

Clearly computing a the minimum and maximum should require linear time,
O(n). But if the computation itself doesn't scale well, then a
O(n) algorithm could perform much worse in practice. Comments?


Do You Yahoo!?
LAUNCH - Your Yahoo! Music Experience

 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list

Current Thread