How is the iteration algorithm of binary vectors of a given length so that at each step was varied by exactly one bit?


Warning: count(): Parameter must be an array or an object that implements Countable in /home/styllloz/public_html/qa-theme/donut-theme/qa-donut-layer.php on line 274
0 like 0 dislike
20 views
How is the iteration algorithm of binary vectors of a given length so that at each step was varied by exactly one bit?

For example, consider a three-bit vector. The lexicographical order is 000, 001, and 010 that is not good, rolled over two bits.
I want so the sequence was, for example, 000, 001, 011, 010, 110, 111, 101, 100.
by | 20 views

1 Answer

0 like 0 dislike
Well, if he wants, take.
by
110,608 questions
257,187 answers
0 comments
40,796 users