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