A permutation generation method
C. T. Fike · The Computer Journal · 1975
This paper describes a new method for generating permutation sequences. Timing experiments indicate that the method is competitive with the interchange methods of Wells, Johnson and Trotter. It is therefore among the fastest available. The method has the advantage that it generates permutations in what Lehmer calls an orderly listing.