Reversing is Not Inherent in Lexicographical Permutation Generation
J. S. Rohl · The Computer Journal · 1990
In his comprehensive 1977 survey of permutation generation methods, Sedgewick4 stated that “(reversing) seems to be inherent in lexicographical (permutation) generation”. It is the purpose of this paper to given an algorithm which does not use reversing and to show its relationship to the classical reversing algorithm of Ord-Smith.3 We also give a number of algorithms to illustrate the flexibility of the new algorithm when applied to related combinatorial problems.