Timeline for How to generate all possible orderless partitions of a list according to another list?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13, 2016 at 14:58 | history | edited | Feyre | CC BY-SA 3.0 | deleted 46 characters in body |
| Aug 13, 2016 at 12:20 | comment | added | Feyre | @happyfish I see, well kirma 's already works for any kind, so rather than me expanding mine, you can accept his ;) | |
| Aug 13, 2016 at 12:17 | comment | added | vapor | yes, I meant, partitions like {2, 3, 3, 3} | |
| Aug 13, 2016 at 12:16 | comment | added | Feyre | @happyfish This code works for any partition of 3, for example try AbsoluteTiming[g[Range[9], {4, 3}]] for {4,3,2} | |
| Aug 13, 2016 at 12:09 | comment | added | vapor | thanks, but actually the partition list is not limited to length 2 | |
| Aug 13, 2016 at 11:13 | history | edited | Feyre | CC BY-SA 3.0 | deleted 6 characters in body |
| Aug 13, 2016 at 11:05 | history | undeleted | Feyre | ||
| Aug 13, 2016 at 11:05 | history | deleted | Feyre | via Vote | |
| Aug 13, 2016 at 11:03 | history | answered | Feyre | CC BY-SA 3.0 |