Skip Navigation

The Computer Journal 1975 18(1):21-22; doi:10.1093/comjnl/18.1.21
© 1975 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 (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fike, C. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A permutation generation method

C. T. Fike *

IBM Systems Research Institute, 219 East 42nd Street, New York, USA

This paper describes a new method for generating permutation sequences. Timing experiments indicate that the method is competitive with the interchange methods of Wells, Johnson and Trotter. It is therefore among the fastest available. The method has the advantage that it generates permutations in what Lehmer calls an orderly listing.

Received June 1973.

* IBM Systems Research Institute, 219 East 42nd Street, New York, N.Y. 10017, USA


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.