TY - JOUR
AU - Rohl, J., S.
AB - Abstract 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. This content is only available as a PDF. Author notes 1 On sabbatical leave at Cornell University. © The British Computer Society
TI - Ord Smith's Pseudo-Lexicographical Permutation Procedure is the Tompkins-Paige Algorithm
JF - The Computer Journal
DO - 10.1093/comjnl/34.6.569
DA - 1991-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/ord-smith-s-pseudo-lexicographical-permutation-procedure-is-the-04GoOSJunH
SP - 569
EP - 570
VL - 34
IS - 6
DP - DeepDyve
ER -