Stefan,
There's nothing wrong with the way the standard library produces
permutations. It does it faster than me (probably also because of a better
algorithm) and in the same order. collect(permutations()) gives all the
permutations in dictionary order, so I guess permutations() produces them
Hi!
I have programmed a very simple function that takes any permutation p of
[1:n] and finds the next permutation in dictionary order. I know this is
well-programmed already, but I am learning.
I have programmed the same algorithm both in Julia and Matlab. It is not a
sophisticated algorithm,
through the performance tips section of the manual, and used
the
various tools it advertises?
Best,
--Tim
On Monday, October 27, 2014 05:50:49 AM Felipe Jiménez l wrote:
Hi!
I have programmed a very simple function that takes any permutation p of
[1:n] and finds the next
to port that to Julia and get
similar performance.
On Mon, Oct 27, 2014 at 8:50 AM, Felipe Jiménez l felipe.j...@gmail.com
javascript: wrote:
Hi!
I have programmed a very simple function that takes any permutation p of
[1:n] and finds the next permutation in dictionary order. I know
