TADM2E 3.12

From Algorithm Wiki
Revision as of 18:13, 11 September 2014 by Algowikiadmin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Let's put into the black box whole set <math>S=\{x_i\}_{i=1}^n</math>. If <math>bb(S)</math> is True, then such subset existing and we can go on:

  1. R:=S
  2. for i:=1 to n do
    1. If <math>bb(R/\{x_i\})</math> is True then <math>R:=R/\{x_i\}</math>

When this iteration is finished R will be subset of S that adds up to k.