Talk:Subset sum problem: Difference between revisions

Content added Content deleted

Inline

Revision as of 08:16, 2 January 2012

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)

Revision as of 15:58, 1 January 2012 (view source) rosettacode>Sluggo (started the discussion)		Revision as of 08:16, 2 January 2012 (view source) rosettacode>Ledrug No edit summary Newer edit →
Line 2:		Line 2:

	[[User:Sluggo\|Sluggo]] 15:58, 1 January 2012 (UTC)		[[User:Sluggo\|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. --[[User:Ledrug\|Ledrug]] 08:16, 2 January 2012 (UTC)