All Subset Sum Increasing Order

Subset_Sum.cpp

void recurse(int index, int N, vector<int> &num, vector<int> &sum, int sumSoFar){
    if(index == N){
        sum.push_back(sumSoFar);
        return;
    }
    recurse(index+1, N, num, sum, sumSoFar+num[index]);
    recurse(index+1, N, num, sum, sumSoFar);
    return;
}

vector<int> subsetSum(vector<int> &num)
{
    // Write your code here.
    vector<int> sum;
    recurse(0, num.size(), num, sum, 0);
    sort(sum.begin(), sum.end());
    return sum;
}