You should find something interesting in the list of permutations which their program gives to you. )

You should try to find some recurrence relation. Also this problem seems to be connected with Gray codes, but I hadn't used them in my solution. You also can find handfull next article about this algo

http://en.wikipedia.org/wiki/Steinhaus-Johnson-Trotter_algorithm