07-03-2003, 03:30 PM
The algorithms work differently, the ones I posted generate strings of zeros and ones representing the values in Gray code for any arbitary byte length. Your algorithm only works for powers of two and generates the corresponding integer values instead.
The algorithm I gave is (AFIAK) the one of the fastest general purpose gray code generation algorithms available. The way the algorithm works is also used in other algorithms for generating binary strings and permutations.
Recursive algorithms are just based on the principle of induction. The pseudo code for the recursive gray code I posted shows how each Gray code string is simply an extension of the previous one, with only the first case actually needing to be defined concretely.
The algorithm I gave is (AFIAK) the one of the fastest general purpose gray code generation algorithms available. The way the algorithm works is also used in other algorithms for generating binary strings and permutations.
Recursive algorithms are just based on the principle of induction. The pseudo code for the recursive gray code I posted shows how each Gray code string is simply an extension of the previous one, with only the first case actually needing to be defined concretely.
esus saves.... Passes to Moses, shoots, he scores!