Skip Navigation

The Computer Journal 1970 13(2):152-155; doi:10.1093/comjnl/13.2.152
© 1970 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 arrow Search for citing articles in:
ISI Web of Science (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ord-Smith, R. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Generation of permutation sequences: part 1

R. J. Ord-Smith *

Computing Laboratory, University of Bradford, Bradford, UK

There has been considerable interest in the last ten years or so in methods of generating sequences of arrangements of n elements in such a way that each of the n! arrangements is generated once, and only once, in the sequence. We call such sequences of arrangements permutation sequences. In part 1 we consider several kinds of permutation sequences and describe some of their properties. Part 2 is devoted to a detailed examination of the practically most efficient six published algorithms and a discussion of implementation difficulties and compiler overheads. An Appendix to Part 2 contains an extensive bibliography of related work.

Received November 1969.

* Computing Laboratory, University of Bradford, Bradford 7


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.