Talk:TADM2E 1.5
From Algorithm Wiki
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?
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?
