A constant-time algorithm for middle levels Gray codes

Torsten Mütze, Jerri Nummenpalo

For any integer $n\ge 1$ a middle levels Gray code is a cyclic listing of all $n$-element and $(n+1)$-element subsets of $\{1,2,\dots ,2n+1\}$ such that any two consecutive subset…