Ord Smith's Pseudo-Lexicographical Permutation Procedure is the Tompkins-Paige Algorithm
J. S. Rohl · The Computer Journal · 1991
Two of the classical permutation algorithms that produce the sequence in pseudo-lexicographical order are those of Tompkins and Paige, on the one hand, and Ord-Smith, on the other. The first uses only rotation, the second only reversing. This paper shows that they are closely related, in that a variant of the Tompkins-Paige algorithm which uses rightrotation, rather than the usual left-rotation, can be simply transformed into the Ord-Smith algorithm.