Timeline for Uniquely generate all permutations of three digits that sum to a particular value?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:18 | review | Late answers | |||
| Sep 29, 2015 at 19:51 | |||||
| May 4, 2010 at 21:19 | comment | added | Erik Garrison | Steve-- Glad it's useful. Apologies for the somewhat cryptic variable naming of the index variables. I adapted one of Prof. Takaoka's implementations to this application, and I kept the naming. | |
| May 1, 2010 at 15:46 | comment | added | Steve Huntsman | Erik--Thanks for posting the Python, this algorithm sounds really cool and the Python should make dissecting and reproducing it a whole lot easier. FYI, if you use graded lex ordering a lot you may be interested in the fast indexing techniques provided in the series of posts referenced in my old answer on this page. (I can provide the MATLAB and maybe some Java code under GPL or Apache.) | |
| May 1, 2010 at 13:35 | comment | added | Erik Garrison | I think I've fallen slightly off-topic :) | |
| May 1, 2010 at 13:32 | history | edited | Erik Garrison | CC BY-SA 2.5 |
changed python implementation to return generator
|
| Apr 30, 2010 at 15:44 | history | answered | Erik Garrison | CC BY-SA 2.5 |