 The ("n","k")-Gray code produced by the above algorithm is always cyclical; some algorithms, such as that by Guan, lack this property when k is odd.On the other hand, while only one digit at a time changes with this method, it can change by wrapping (looping from "n" − 1 to 0).In Guan's algorithm, the count alternately rises and falls, so that the numeric difference between two Gray code digits is always one.