Timeline for Find all the possible ways of partitioning a list into a set of pairs of element
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot | replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/ | |
| Jul 15, 2015 at 2:28 | history | edited | Mr.Wizard | CC BY-SA 3.0 | deleted 329 characters in body |
| Jul 15, 2015 at 0:30 | comment | added | LLlAMnYP | ciao also warns that Map is quite slow to replace indices with elements, but see the comment thread under his answer for details :-) | |
| Jul 15, 2015 at 0:12 | comment | added | Mr.Wizard | @LLlAMnYP That sounds like a much better idea. I'll write it up later and replace this mess. Thank you! | |
| Jul 14, 2015 at 14:14 | comment | added | LLlAMnYP | Actually, partitions[list,2] on its own appears to do the job just fine and about two times as fast as my solution. Simply use Map[list[[#]]&,partitions[Range... as I mentioned under ciao's answer. | |
| Jul 14, 2015 at 4:56 | history | answered | Mr.Wizard | CC BY-SA 3.0 |