Generation, Ranking and Unranking of Permutations based on the Mixed-Radix Codes
M. C. Er · Journal of Information and Optimization Sciences · 1986
A new algorithm for generating all permutations is presented, based on the interesting relation between the set of permutations and the set of mixed-radix codes. Indeed, the 1–1 mapping between these two sets is suggested by the existence of a pair of coding and decoding procedures. Finally, the ranking and unranking algorithms for permutations operating via mixed-radix codes are also derived.