Go backward to Ring Successor Go up to Top Go forward to Gray Code Computation |
Recursive construction.
i G1(i) 0 0 1 1
i Gn(i) i Gn(i) 0 0 Gn-1(0) n-1 1 Gn-1(0) 1 0 Gn-1(1) n-2 1 Gn-1(1) ... ... ... ... n/2-1 0 Gn-1(n/2-1) n/2 1 Gn-1(n/2-1)
H(i) = G(i) = i xor (i/2).