Solve the following sum of subset problem using backtracking: w= {1, 3, 4, 5}, m=8. Find the possible subsets of 'w' that sum to 'm'.

9.8kviews

written 7.9 years ago by

satishmanje93 • 250

modified 3.9 years ago by

pedsangini276 • 4.8k

Subject: Analysis Of Algorithm

Topic: Backtracking

Difficulty: High

analysis of algorithms

ADD COMMENT EDIT

1 Answer

732views

written 7.7 years ago by

satishmanje93 • 250

Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We are considering the set contains non-negative values. It is assumed that the input set is unique (no duplicates are presented).

Using exhaustive search we …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.