Skip Navigation

The Computer Journal 1971 14(2):136-139; doi:10.1093/comjnl/14.2.136
© 1971 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 (18)
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 2

R. J. Ord-Smith *

Computing Laboratory, University of Bradford, Bradford, UK

The main purpose of Part 2 is to present explicitly the six fastest general permutation algorithms in an improved and standardised form. A comparison shows the kind of difficulties which can arise in the implementation of a high level language. An appendix contains an extended bibliography. A brief account of continuing work is included.

Received July 1970.

* Computing Laboratory, University of Bradford, Bradford, Yorkshire BD7 1DP


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.