Timeline for Need to create a function to generate all permutations of Range[$n$] [duplicate]
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2014 at 19:00 | comment | added | Leonid Shifrin | @Mr.Wizard Ok, done. | |
| Apr 15, 2014 at 18:15 | comment | added | Mr.Wizard | @Leonid I would prefer that you copy and paste. | |
| Apr 15, 2014 at 17:53 | comment | added | Leonid Shifrin | @Mr.Wizard Ok, fair enough. Perhaps, what I wanted to say was that there wasn't a practical (fast enough) solution for really large number of permutations posted for that question, while I believe I do have one. Re: moving - sure. Can you do it by merging the answer sets, or do you suggest that I copy and paste it from here? | |
| Apr 15, 2014 at 17:43 | comment | added | Mr.Wizard | @Leonid The emphasis on the old question is: "Question: Is there a different way to generate the permutations that avoids this problem?" Will you consider moving your new answer? | |
| Apr 15, 2014 at 14:53 | comment | added | Leonid Shifrin |
@Mr.Wizard This may look like a duplicate, but the emphasis here is on how one can make this work, not on the mere fact that the straight-forward use of Permutations will blow up the memory.
|
|
| Apr 15, 2014 at 3:20 | comment | added | Mr.Wizard | Related: (9537), (21584) | |
| Apr 15, 2014 at 3:15 | comment | added | Mr.Wizard | Note to all posters: please take the time to look for duplicates before you answer. This question was almost certainly asked before, and finding a duplicate was easy. | |
| Apr 15, 2014 at 3:13 | history | closed | Mr.Wizard | Duplicate of Permutations[Range[12]] produces an error instead of a list | |
| Apr 15, 2014 at 2:17 | history | tweeted | twitter.com/#!/StackMma/status/455892595408138240 | ||
| Apr 15, 2014 at 2:14 | answer | added | phosgene | timeline score: 0 | |
| Apr 15, 2014 at 1:58 | answer | added | halirutan | timeline score: 3 | |
| Apr 15, 2014 at 1:50 | comment | added | m_goldberg | 14! is a rather large number, so I understand why you might not want to store all the permutations in memory. However, even if you accomplish your goal of generating the permutations one-by-one, how long do you think it will take to score more than 87 billion lists of 14 integers? | |
| Apr 15, 2014 at 1:38 | history | edited | m_goldberg | CC BY-SA 3.0 |
General clean-up
|
| Apr 15, 2014 at 1:21 | comment | added | ciao |
Look at the Conbinatorica package. You can generate the permutations one at a time to score using its functions.
|
|
| Apr 15, 2014 at 1:18 | history | asked | Ryan Summers | CC BY-SA 3.0 |