Finding All Subsets of an Array or String – The Power of Recursion

Understanding Subsets Given an array or string, the goal is to find all possible subsets (including the empty set). The total number of subsets for a set of size n is 2^n. Example: For the array {1,2,3}, the subsets are: {},{1},{2},{3},{1,2},{1,3},{2...