Article ID Journal Published Year Pages File Type
6872332 Discrete Applied Mathematics 2014 6 Pages PDF
Abstract
We present lexicographic ranking and unranking algorithms for derangements expressed in cycle notation. These algorithms run in O(nlogn) time, require O(n) space, and use O(n) arithmetic operations. Similar algorithms that require less than or equal to O(nlogn) time with O(n) space complexity have not previously been proposed.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Lexicographic ranking and unranking of derangements in cycle notation
Authors
, ,