Skip to main content

Timeline for Partition list into $n$ sublists

Current License: CC BY-SA 3.0

13 events
when toggle format what by license comment
Nov 4, 2019 at 15:00 history tweeted twitter.com/StackMma/status/1191369653504921600
Nov 4, 2019 at 2:52 answer added Mr.Wizard timeline score: 2
Nov 3, 2019 at 21:38 history edited Mr.Wizard
edited tags
Nov 3, 2019 at 20:25 answer added Ihar timeline score: 2
Mar 28, 2017 at 8:55 answer added Coolwater timeline score: 1
Mar 28, 2017 at 8:53 answer added ciao timeline score: 5
Mar 28, 2017 at 8:45 comment added vapor OK, I undeleted my answer. But I think it is not very contributive after all...
Mar 28, 2017 at 8:44 comment added Sascha @happyfish, yes your code is a possible solution
Mar 28, 2017 at 8:42 answer added ubpdqn timeline score: 1
Mar 28, 2017 at 8:41 comment added Sascha @happy fish thanks for this observation; this is yet another corner case that is ill defined and does depend on what one wishes to accomplish. My application uses only needs the special case $n=2$ and I want chunks of equal size where possible but any solution is interesting in the scope of this broader question. In a build-in function I would expect the partitioning scheme as an option.
Mar 28, 2017 at 8:40 answer added vapor timeline score: 1
Mar 28, 2017 at 8:34 comment added vapor In your program, splitList[4][Range[9]] returns {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {}} is it intended? How about {{1,2,3,4,5,6,7,8,9},{},{},{}}?
Mar 28, 2017 at 8:12 history asked Sascha CC BY-SA 3.0