Talk:TADM2E 1.5

From Algorithm Wiki
Revision as of 13:59, 5 July 2018 by Shloub (talk | contribs) (Created page with "For S = {1, 2, 5, 9, 10} and T = 11, wouldn't the largest to smallest strategy ignore unfitting items and find the {10, 1} solution?")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

For S = {1, 2, 5, 9, 10} and T = 11, wouldn't the largest to smallest strategy ignore unfitting items and find the {10, 1} solution?

Retrieved from "https://algorist.com/algowiki_v2/index.php?title=Talk:TADM2E_1.5&oldid=552"