Talk:Subset sum problem

From Rosetta Code
Revision as of 08:16, 2 January 2012 by rosettacode>Ledrug

I ran into some unanticipated implementation issues the last time I tried to create a task, so I'd like to request feedback on this one before promoting it even though it seems straightforward enough to me.

Sluggo 15:58, 1 January 2012 (UTC)

1) Why the words? 2) Caution about trying all subsets being "infeasible" seems superfulous. The problem is NP-complete, so for any algorithm, it's easy enough to construct a data set that will run (practically) forever or exhaust memory. --Ledrug 08:16, 2 January 2012 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Subset_sum_problem?oldid=210684"