orders of permutations

From: john (blitzjn_at_hotmail.com)
Date: 06/11/04 

Date: Fri, 11 Jun 2004 13:03:20 +0000 (UTC)

Hello,

  Well, I am a student in a computer math class. My teacher totally
fell
behind on schedule and ended up assigning us a programming assignment
during finals week. Therefore, I cannot consult him for questions.
Well,
There are two parts to the problem. I have completed part 1, which is
creating a program that lists all permutations of 1,2,..,n in such a
way
that consecutive permutations differ by a single transposition using
the
Johsnon-Trotter algorithm. However, there is a second part to the
question
which I think he meant to make trivial but I am not too familiar with
the
terms and logic behind his question so I am confused... It states:

 "Using the program you wrote, find the largest order that a
permutation
of 1,2,3,...,n can have. Run it for as large a value of n as you can
and
tabulate the largest possible orders as a function of n."

Any and all feedback/insight/help would be greatly appreciated!
Thanks!

- John