Abstract
When the permutations are ordered lexicographically there is an ordering number corresponding to each permutation. A relation between the ordering numbers of complementary permutations is shown which can be useful in a computer generation of permutations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have