Reversing is Not Inherent in Lexicographical Permutation Generation

Rohl, J.S.

dc.contributor.author	Rohl, J.S.	en_US
dc.date.accessioned	2007-04-23T17:37:16Z
dc.date.available	2007-04-23T17:37:16Z
dc.date.issued	1989-06	en_US
dc.identifier.citation	http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1019	en_US
dc.identifier.uri	https://hdl.handle.net/1813/6819
dc.description.abstract	In his comprehensive 1977 survey of permutation generation methods, Sedgewick [4] stated that "(reversing) seems to be inherent in lexicographical (permutation) generation". It is the purpose of this paper to give 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 related algorithms to illustrate the flexibility of the new algorithm.	en_US
dc.format.extent	754979 bytes
dc.format.extent	171315 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.language.iso	en_US	en_US
dc.publisher	Cornell University	en_US
dc.subject	computer science	en_US
dc.subject	technical report	en_US
dc.title	Reversing is Not Inherent in Lexicographical Permutation Generation	en_US
dc.type	technical report	en_US