Create all the possible combinations of array a – Software Engineering<\/p>\n
The subset-sum problem is defined as follows: given a set B of n positive integers and an integer K, can you find a subset of B whose elements’ summation is equal to K? Design an algorithm to solve this problem. Address its correctness and running time.<\/p>\n
Input: set B of n positive integers {b1, b2,….., bn} and an integer K.<\/p>\n
Output: whether there exist such a subset of B called B’ its elements summation is equal to K.<\/p>\n
B’= BA, where A = {a1, a2,…….., an} in which AB= b1a1 +b2a2 +……+ bnan. Where ai is either 0 or 1.<\/p>\n
Algorithm:
\n– For i= 1 to 2n (We have 2n different combinations set to be checked)
\n1. Create all the possible combinations of Array A and do:
\n– Compute Sum =
\n– If Sum = K then there is a subset sum to K. This subset B’= {b1a1, b2a2, ……, bnan}when ai representing 1.
\n– return the subset B’
\n– Otherwise return there is no subset sum to K.<\/p>\n
The run time is O(2n) since it needs to go through all possible subsets to find the subset that sum to K.<\/p>\n","protected":false},"excerpt":{"rendered":"
Create all the possible combinations of array a – Software Engineering The subset-sum problem is defined as follows: given a set B of n positive integers and an […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2769],"tags":[2771,2772,2762,2763],"class_list":["post-34500","post","type-post","status-publish","format-standard","hentry","category-words-doctorate","tag-high-quality-research-paper-writing-services-for-students","tag-best-research-paper-writing-services-in-the-u-s","tag-health-care-assignment-help-and-writing-services","tag-best-essay-writing-service-uk-trustpilot"],"_links":{"self":[{"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/posts\/34500","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/comments?post=34500"}],"version-history":[{"count":0,"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/posts\/34500\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/media?parent=34500"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/categories?post=34500"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.homeworkacetutors.com\/assessments\/wp-json\/wp\/v2\/tags?post=34500"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}