Write an algorithm for sum of subsets. Solve the following problem. M=30 W={5, 10, 12, 13, 15, 18}

58kviews

written 7.3 years ago by

teamques10 ★ 65k

• modified 4.1 years ago

analysis of algorithms

ADD COMMENT EDIT

1 Answer

8.5kviews

written 7.3 years ago by

teamques10 ★ 65k

Problem statement:

Let, S = {S1 …. Sn} 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, S1 ≤ S2 ≤…. ≤ Sn …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.