inductive algorithm for permutations - help needed

Hi,

I'm having some trouble with an inductive algorithm that calculates all

permutations from 1 to n. the struct i'm using is a list of lists (sorry

about my english), wich each element has a pointer to a list wich contains a

permutation and another pointer, to the other element, wich contains another

permutation, and so on.

I'm trying to use a recursion, so i can include the elements from left

to right at the first perm, wich is (1), giving me (2)-(1) and (1)-(2), and

doing the same thing with 3,4,5,...,n.

Any hints for the algorithm would be very useful and apreciated.

thanx 4 advance,

Daniel

--