Gray code for derangements
BarilJean-Luc, VajnovszkiVincent · Discrete Applied Mathematics · 2004
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor ei...