Permutations/Rank of a permutation: Difference between revisions
Content added Content deleted
m (→{{header|Haskell}}: Simplified `foldr (*) 1` to `product`) |
|||
| Line 860: | Line 860: | ||
Unfortunately, as of the 0.3 release of Julian, this code can not be used to address the StackOverflow question. Although many of Julia's permutation built-in functions support large permutations, <tt>nthperm(p)</tt> is limited to partitions of no more than 20 objects. <tt>p = randperm(114)</tt> works fine, but <tt>nthperm(p)</tt> throws an <tt>OverflowError</tt>. Arguably, this is a bug, and it may be rectified in future releases. |
Unfortunately, as of the 0.3 release of Julian, this code can not be used to address the StackOverflow question. Although many of Julia's permutation built-in functions support large permutations, <tt>nthperm(p)</tt> is limited to partitions of no more than 20 objects. <tt>p = randperm(114)</tt> works fine, but <tt>nthperm(p)</tt> throws an <tt>OverflowError</tt>. Arguably, this is a bug, and it may be rectified in future releases. |
||
<lang Julia> |
<lang Julia>using Printf |
||
nobjs = 4 |
nobjs = 4 |
||
a = collect(1:nobjs) |
a = collect(1:nobjs) |
||