Definition: Given a ranking, r, generate the rth permutation of n elements.
Note: This can be done in O(n) time.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 27 October 2022.
HTML page formatted Thu Oct 27 16:39:43 2022.
Cite this as:
Paul E. Black, "unranking", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 27 October 2022. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/unrank.html