Talk:TADM2E 3.12

From Algorithm Wiki
Revision as of 20:05, 6 December 2017 by Idealamz (talk | contribs) (Created page with "it's kind of clear that if you should not return the minimal subset the whole set is the trivial solution. actually, the suggested solution will return the whole set any time...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

it's kind of clear that if you should not return the minimal subset the whole set is the trivial solution. actually, the suggested solution will return the whole set any time that the first item in the given set most to be part of the subset.

for instance: S = {1,2,4,6,8,10}, k = 3