3.27

From The Algorithm Design Manual Solution Wiki
Revision as of 18:06, 20 September 2020 by Algowikiadmin (talk | contribs) (Created page with "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 a subset exists and we can go on: # R:=S # for i:=1 to n do ##...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Let's put into the black box whole set . If is True, then such a subset exists and we can go on:

  1. R:=S
  2. for i:=1 to n do
    1. If is True then

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

Above solution works even when there are multiple subsets that add up to k.


Back to Chapter 3