Data-Structure-Algorithm-Java/Recursion/Subset.java at main · gourabofficial/Data-Structure-Algorithm-Java · GitHub

27 lines (21 loc) · 586 Bytes

import java.util.ArrayList;

public class Subset {

public static void main(String[] args) {

ArrayList <Integer> subset = new ArrayList<>();

int n = 3;

findSubset(n, subset);

}

static void findSubset(int n , ArrayList<Integer> subset){

//base case

if(n == 0){

System.out.println(subset);

return;

}

//include the element

subset.add(n);

findSubset(n-1, subset);

//exclude the element

subset.remove(subset.size() - 1);

findSubset(n-1, subset);

}

Expand file tree