A hwk question and apparently also a common interview question I'm having trouble with:
"Write an algorithm (pseudocode) that prints out all the subsets of three elements of a set of n elements. The elements of this set are stored in a list that is the input to the algorithm."
So for example if S = {1,2,3,4} the algorithm would print out these four combinations:
123 124 134 234
Can anyone offer their thoughts / a solution?