Talk:Subset sum problem: Difference between revisions
Content added Content deleted
(follow-up on optimization of the zero-sum REXX program. -- ~~~~) |
|||
| Line 18: | Line 18: | ||
:: 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) |
:: 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) |
||
::: Huh, "doable" is such a subjective thing. Suppose the thirty one numbers given in the task were instead these:<lang>-61 1 32 373 311 249 311 32 -92 -185 -433 -402 -247 156 125 249 32 -464 -278 218 32 -123 -216 373 -185 -402 156 -402 -61 -31 902</lang> |
|||
::: would it still be doable? --[[User:Ledrug|Ledrug]] 04:42, 8 May 2012 (UTC) |
|||