Skip Navigation

The Computer Journal 1990 33(3):274-278; doi:10.1093/comjnl/33.3.274
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rohl, J. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Reversing is Not Inherent in Lexicographical Permutation Generation

J. S. Rohl

Department of Computer Science, The University of Western Australia, Nedlands, Western Australia, 6009

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.

Received August 1989. revised September 1989.

* Department of Computer Science, The University of Western Australia, Nedlands, Western Australia, 6009


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.