Timeline for Need to create a function to generate all permutations of Range[$n$]
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2014 at 3:50 | comment | added | halirutan | @rasher Ah, sorry. I'm very bad with insider jokes when they are in a different language. You would have to explain this in detail to make me understand. I guess this is not worth the effort :-) | |
| Apr 15, 2014 at 3:38 | comment | added | ciao | I think the joke got lost in translation... in any case, the sports syndicate's money is safe, by the time the OP gets results, it will be next season. | |
| Apr 15, 2014 at 3:37 | comment | added | halirutan | @rasher I'm not concerned about how quick you can create the list of permutations, but what he will actually do with it. If his algorithm working on each permutation is only a tiny bit non-trivial, the overall run-time will climb ridiculously fast. | |
| Apr 15, 2014 at 2:10 | comment | added | ciao | Precisely why I recommended the Conbinatorica package (third-party, out of San Quentin): threatens data with a shiv, things happen quickly... | |
| Apr 15, 2014 at 2:04 | history | edited | halirutan | CC BY-SA 3.0 |
added 161 characters in body
|
| Apr 15, 2014 at 1:58 | history | answered | halirutan | CC BY-SA 3.0 |