Anonymous user
Talk:Subset sum problem: Difference between revisions
→how many solutions?
Line 28:
:::::: It takes as long as the original set of weights (to complete). This is how the REXX program works. Even though takes longer to find the first solution (if any), that doesn't mean that it takes a longer time to complete. As for my definition of "doable", to me means that the program can complete is a reasonable time, and "reasonable" depends just how badly I want the results (output). I've been running a program (not related to this) for over five years now because I want the output. For something this trivial (the summing of weights, albeit it consumes a lot of computer time), I won't bother. I'm using my fast computer for other things. And my main computer that I connect to the internet is just too slow (and I hate to say what century I built it). -- [[User:Gerard Schildberger|Gerard Schildberger]] 06:42, 8 May 2012 (UTC)
::::::: ''It takes as long as the original set of weights (to complete)''
::::::: Does it? Rexx works in mysterious ways. Anyhow, I can't verify that myself, as regina-rexx complains about something like <code>sh: 1: COMBN: not found</code> when trying to run your code. One thing though, I wouldn't call subset sum problem "something this trivial", but to each his own. --[[User:Ledrug|Ledrug]] 07:34, 8 May 2012 (UTC)
:::::::: Come to think of it, did the interpreter just call the shell when it couldn't resolve "combN"? That's seriously naughty. --[[User:Ledrug|Ledrug]] 07:42, 8 May 2012 (UTC)
| |||