Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

printSubsets

Language/Type: Java recursion
Author: Marty Stepp (on 2020/11/05)

Write a recursive method called printSubsets that takes an array of integer values and that prints all subsets of the list. For example, if we have: 

        int[] list = {1, 2, 3};

and we make the call: 

        printSubsets(list);

The method should print the 8 subsets: 

        []
        [3]
        [2]
        [2, 3]
        [1]
        [1, 3]
        [1, 2]
        [1, 2, 3]

Your method can print the subsets in any order, but you should preserve the order of the values from the list. For example, the subsets of [42, 23] should be listed as: 

        []
        [23]
        [42]
        [42, 23]

You may assume the list has no duplicate values.

Type your solution here:


This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.