Print sums of all subsets of a given set

https://www.geeksforgeeks.org/print-sums-subsets-given-set/

Given an array of integers, print sums of all subsets in it. Output sums can be printed in any order.

Examples :

Input : arr[] = {2, 3}
Output: 0 2 3 5

Method 2 (Iterative)
As discussed above, there are total 2n subsets. The idea is generate loop from 0 to 2n – 1. For every number, pick all array elements which correspond to 1s in binary representation of current number.

void subsetSums(int arr[], int n)

{

    // There are totoal 2^n subsets

    long long total = 1<<n;

  

    // Consider all numbers from 0 to 2^n - 1

    for (long long i=0; i<total; i++)

    {

        long long sum = 0;

  

        // Consider binary reprsentation of

        // current i to decide which elements

        // to pick.

        for (int j=0; j<n; j++)

            if (i & (1<<j))

                sum += arr[j];

  

        // Print sum of picked elements.

        cout << sum << " ";

    }

}




    static void subsetSums(int []arr, int l,

                            int r, int sum )

    {

          

        // Print current subset

        if (l > r)

        {

            System.out.print(sum + " ");

            return;

        }

      

        // Subset including arr[l]

        subsetSums(arr, l + 1, r, 

                   sum + arr[l]);

      

        // Subset excluding arr[l]

        subsetSums(arr, l + 1, r, sum);

    }