jborella(_at_)it-c(_dot_)dk wrote:
You should use a recursive, functional approach.
Thank you for the answer, but I am more focused on the dynamic programming
aspect of the recursion. In my example calc1 would be calculated twice,
while one time should do it.
To rephrase my question I would like being able to use dynamic programming
in xsl (a simpler example than mine would be fibonacci numbers in linear
time, although it could be solved without dynamic programming as well).
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list