HI all

Can anyone help me with this algorithm (I ned to write the code in java)......The java code would also be helpful

**Describe a recursive algorithm for enumerating all permutations of the numbers {1,2,...,n}. **

I'd appriciate it if somebody could explain this problem to me and give me some idea on how i can get started

Many Thanks