Permutations: Difference between revisions

→‎{{header|Julia}}: multiset_permutations
(→‎Recursive version: `unique` redundant)
(→‎{{header|Julia}}: multiset_permutations)
Line 3,548:
eRCod eRCdo eRoCd eRodC eRdCo eRdoC eCRod eCRdo eCoRd eCodR eCdRo eCdoR
eoRCd eoRdC eoCRd eoCdR eodRC eodCR edRCo edRoC edCRo edCoR edoRC edoCR
</pre>
 
<lang>
# Generate all permutations of size t from an array a with possibly duplicated elements.
collect(Combinatorics.multiset_permutations([1,1,0,0,0],3))
</lang>
{{out}}
<pre>
7-element Array{Array{Int64,1},1}:
[1, 1, 0]
[1, 0, 1]
[1, 0, 0]
[0, 1, 1]
[0, 1, 0]
[0, 0, 1]
[0, 0, 0]
</pre>
 
Anonymous user