Do you need to do it recursively? It''s probably easier iteratively.
One way is to create a counter with as many bits as elements, and step through all possibilities in that counter, outputing the elements (each bit in the counter refers to a single element, if the bit is 1, output the element).