Linear-Time Ranking of Permutations

Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutations. This is frequently used for indexing data structures by permutations. We present algorithms for computing both the ranking function and its inverse using O(n) arithmetic operations.

• Type: Conference
• Year: 2007
• Where: ESA
• Authors: Martin Mares, Milan Straka
• Keywords: ESA 2007, Lexicographic Order, Lexicographic Ranking Function, Symbols Translates Permutations