Anonymous user
Talk:Subset sum problem: Difference between revisions
follow-up on optimization of the zero-sum REXX program. -- ~~~~
(→how many solutions?: added comment about the worth of optimization (or not). -- ~~~~) |
(follow-up on optimization of the zero-sum REXX program. -- ~~~~) |
||
Line 16:
:: Uf-ta. I was going to put in some optimizations into the REXX program, but with over 1/3 million subsets (for solutions), I'm not going to bother. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:08, 3 May 2012 (UTC)
:: Well, I decided to go ahead and optimize the REXX program, and it's twice as fast. After a day of thinking, I again made it twice as fast. The brute force solution may not be appropriate (says Sluggo), but it's doable. -- [[User:Gerard Schildberger|Gerard Schildberger]] 03:51, 8 May 2012 (UTC)
| |||