Ask
Login
0
9.9kviews
Write and explain sum of subset algorithm
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 3.9 years ago

Write and explain sum of subset algorithm for W = {2, 7, 8, 9, 15} M = 17
analysis of algorithms
ADD COMMENT EDIT
1 Answer
2
1.4kviews
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k
  1. Given positive numbers (weight) w_i where (1<=i<=n) and m.
  2. This problem calls for finding all subsets of w_i whose sum is m.
  3. For e.g. if n=4, m=31, (w_1,w_2,w_3,w_4) = (11, 13, 24, 7).
  4. Then the desired subset are (11, 13, 7) and (2, 4, 7).
  5. In this method of giving …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.