Paradigms for Optimization Problems - A Concise and Practical Introduction to Programming Algorithms in Java - page 195

{ if (tab[ i ])
System . out . print ( "1 " );
else
System . out . print ( "0 " ); }

System . out . println ( "" );
}

static void Enumerate( boolean [] selection , int pos)

if (pos==selection .length − 1)
{ display( selection ); }

// terminal case, reach length n

else
pos++;
// Set the (pos+1)th bit to 1
selection [pos]= true ;
Enumerate(selection ,pos) ;
// Set the (pos+1)th bit to 0
selection [pos]= false ;
Enumerate(selection ,pos) ;
}

}

public static void main( String [ ] args )

int n=4; int i;
// Binary representation of numbers
boolean [] select= new boolean [n];
for (i=0;i < n ; i ++)
{ select [ i]= false ; }

// optional since array creation set it

to all zero
// Launching the enumeration from the first bit (index 0)
Enumerate(select , − 1) ;
}

}

Running the program by executing the compiled byte code ( javac Enumeration;
java Enumeration ), we get the following output:
1111
1110
1101
1100
1011
1010
1001
1000
0111
0110
0101
0100
0011