Breaking News: Grepper is joining You.com. Read the official announcement!

subset sum java

Pratik Lonari answered on August 15, 2022 Popularity 6/10 Helpfulness 1/10

answer subset sum java

subset sum java

Comment

 static boolean isSubsetSum(int set[],
                               int n, int sum)
    {
        // Base Cases
        if (sum == 0)
            return true;
        if (n == 0 && sum != 0)
            return false;
 
        // If last element is greater than
        // sum, then ignore it
        if (set[n - 1] > sum)
            return isSubsetSum(set, n - 1, sum);
 
        /* else, check if sum can be obtained
        by any of the following
            (a) including the last element
            (b) excluding the last element */
        return isSubsetSum(set, n - 1, sum) || isSubsetSum(set, n - 1, sum - set[n - 1]);
    }

Popularity 6/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java subset-sum

Link to this answer
Share Copy Link

Contributed on Aug 15 2022

Pratik Lonari

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

subset sum java

Contents

More Related Answers

subset sum java

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.