CS420 Discussion One
                       ====================

Consider the problem of producing all permutations of the numbers 1 to n.

1a Find an algorithm for it. Is it recursive or iterative?  Show how it works for n=4.
 
1b Is this problem tractable? Argue your case.

1c Is it closed? Argue your case.