Show simple item record

dc.contributor.authorRohl, J.S.en_US
dc.date.accessioned2007-04-23T17:37:16Z
dc.date.available2007-04-23T17:37:16Z
dc.date.issued1989-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1019en_US
dc.identifier.urihttps://hdl.handle.net/1813/6819
dc.description.abstractIn 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.extent754979 bytes
dc.format.extent171315 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleReversing is Not Inherent in Lexicographical Permutation Generationen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics