Talk:Permutations with some identical elements: Difference between revisions
Content added Content deleted
mNo edit summary |
No edit summary |
||
Line 26: | Line 26: | ||
(I've added whitespace and used a bigger font to make the subscripts easier to read.) -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 03:51, 27 July 2019 (UTC) |
(I've added whitespace and used a bigger font to make the subscripts easier to read.) -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 03:51, 27 July 2019 (UTC) |
||
: That is excellent! --[[User:Tobega|Tobega]] |
: That is excellent! --[[User:Tobega|Tobega]] |
||
== Close to the permutations task == |
|||
Note that one of the simplest algorithms to generate permutations ([[Permutations#Iterative_implementation|this one]], which also appears in Knuth's TAOCP), can be trivially modified to handle this task: just replace < and > with <= and >=. |
|||
[[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 06:12, 10 February 2020 (UTC) |