Write an algorithm of sum of subsets.

51kviews

written 7.8 years ago by

• modified 4.1 years ago

Write an algorithm of sum of subsets. Solve following problem and draw portion of state space tree M = 35, W = (5, 7, 10, 12, 15, 18, 20)

analysis of algorithms

ADD COMMENT EDIT

1 Answer

7.4kviews

written 7.8 years ago by

teamques10 ★ 65k

Problem statement:

Let, $S = {S_1 …. S-n}$ be a set of n positive integers, then we have to find a subset whose sum is equal to given positive integer d.It is always convenient to sort the set’s elements in ascending order. That is, $S_1 ≤ S_2 ≤…. ≤ S_n$ …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.