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 Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment