Subject: Re: [xsl] Show all permutations of N coins ... without using recursion?|
From: David Carlisle <davidc@xxxxxxxxx>
Date: Sun, 01 Sep 2013 11:41:43 +0100
Jacob Mal} wrote:
You just iterate from 1 to 2^N, each step gives you one output sequence, you just have to convert it to the desired format.
Thank you very much!
I did as you suggested and it works great.
The below stylesheet shows the permutations of N coins, implemented in two ways: (1) using recursion, and (2) using iteration.
By the way, I recently learned about the xsl:iterate instruction. Wow! Such a useful instruction. How have I lived without it all these years.
-- google plus: https:/profiles.google.com/d.p.carlisle