Anonymous user
Talk:Subset sum problem: Difference between revisions
→how many solutions?: added comment about worthwhile optimization (or not). -- ~~~~
(→how many solutions?: added comment about optimizing the REXX program solution (version 2). -- ~~~~) |
(→how many solutions?: added comment about worthwhile optimization (or not). -- ~~~~) |
||
Line 38:
:: After saying I wasn't going to optimize the REXX program (two versions are now on RC), I kept thinking about the program and eventually made it over a magnitude times faster. -- [[User:Gerard Schildberger|Gerard Schildberger]] 23:59, 20 May 2012 (UTC)
:: After upgrading the 2nd version of the REXX program that sorted the names by their weights (and realizing the order of magnitude improvement), it seemed rediculus to keep the much slower version around, so it was deleted and the 2nd version was enhanced to sort the output which presents the names in alphabetical order, thus preserving the original order of the names. Much more optimization could be made, but I'm not sure the effort would be worthwhile. I may come back to this program after my other computer is freed up from its heavy usage. -- [[User:Gerard Schildberger|Gerard Schildberger]] 05:44, 29 May 2012 (UTC)
| |||