By David Pager
Communications of the ACM,
March 1970,
Vol. 13 No. 3, Page 193
10.1145/362052.362063
Comments
A number system described here is particularly suitable for numbering the permutations. An algorithm is then presented by which the permutation associated with a number of this kind may be obtained. Since arithmetical operations, such as the addition of 1, are easily performed in the number system, one may make use of the algorithm to generate the permutations one at a time, using a minimal amount of work space. Employed for this purpose, it provides an alternative to the method given in [1].
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
