Skip Navigation

The Computer Journal 1978 21(4):302-305; doi:10.1093/comjnl/21.4.302
© 1978 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 (10)
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?

Generating permutations by choosing

J. S. Rohl *

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

The purpose of this paper is to give a simple, general algorithm which will produce arrangements of n marks taken r at a time where the marks may or may not be distinct. Various procedures based on the algorithm are presented, some producing the arrangements in lexicographical order, some not. The algorithm is easy to use as the basis for a solution to some combinatorial problem as an example shows.

Received January 1977.

* Department of Computer Science, 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.