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:59 | |||||
| Apr 29, 2010 at 22:15 | comment | added | Steve Huntsman | Guess so. I'm dying to see how to do this nonrecursively. I've used recursive code for this for a decade, though I never had a need to make it go fast. | |
| Apr 29, 2010 at 21:16 | comment | added | Erik Garrison | I'll do one in Python. Close enough? :) | |
| Apr 29, 2010 at 20:02 | comment | added | Steve Huntsman | Can you post pseudocode? | |
| Apr 29, 2010 at 14:37 | history | edited | Erik Garrison | CC BY-SA 2.5 |
clarification that this algorithm works for any-sized sets and multisets
|
| Apr 27, 2010 at 23:57 | history | answered | Erik Garrison | CC BY-SA 2.5 |