Subset sum problem solved using a recursive brute force approach 【O(2^N) time complexity】

In this article, we will solve Subset Sum problem using a recursive approach where the key idea is to generate all subset recursively. It will take O(2^N) time complexity.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/subset-sum-problem-recursive-approach/