Talk:Subset sum problem: Difference between revisions

Content added Content deleted

Inline

Revision as of 20:11, 3 May 2012 (view source) rosettacode>Ledrug (→‎how many solutions?: a lot) ← Older edit		Revision as of 22:08, 3 May 2012 (view source) rosettacode>Gerard Schildberger (→‎how many solutions?: added comment about the worth of optimization (or not). -- ~~~~) Newer edit →
Line 14:		Line 14:

	: Apparently there are 349167 combinations of zero sum. Considering subset sum problem is about deciding whether any combination exists at all, that does seem a little high as far as designing a task is concerned: making solutions a dime a dozen doesn't motivate people to use proper methods a difficult task deserves. --[[User:Ledrug\|Ledrug]] 20:11, 3 May 2012 (UTC)		: Apparently there are 349167 combinations of zero sum. Considering subset sum problem is about deciding whether any combination exists at all, that does seem a little high as far as designing a task is concerned: making solutions a dime a dozen doesn't motivate people to use proper methods a difficult task deserves. --[[User:Ledrug\|Ledrug]] 20:11, 3 May 2012 (UTC)

			:: 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)