Generate n-bit Gray Codes | Set 2

Given a number n, generate bit patterns from 0 to 2^n-1 such that successive patterns differ by one bit.

Examples: 

Input: n=2
Output: 00 01 11 10
Explanation:
Every adjacent element of gray code differs only by one bit. So the n bit grey codes are: 00 01 11 10

Input: n=3
Output: 000 001 011 010 110 111 101 100
Explanation:
Every adjacent element of gray code differs only by one bit. So the n bit gray codes are: 000 001 011 010 110 111 101 100

Another approach of Generate n-bit Gray Codes has already been discussed.

 
The idea is to get gray code of binary number using XOR and Right shift operation. 

1. The first bit(MSB) of the gray code is same as the first bit(MSB) of binary numbers.
2. The second bit(from left side) of the gray code equals to XOR of first bit(MSB) and second bit(2nd MSB) of the binary number.
3. The third bit(from left side) of the gray code equals to XOR of the second bit(2nd MSB) and a third bit(3rd MSB) and so on..

In this way, the gray code can be calculated for the corresponding binary number. So, it can be observed that the ith element can be formed by bitwise XOR of i and floor(i/2) which is equal to the bitwise XOR of i and (i >> 1) i.e., i right-shifted by 1. By performing this the MSB of the binary number is kept intact and all the other bits are performed bitwise XOR with its adjacent higher bit.

000
001
011
010
110
111
101
100

Complexity Analysis: 

• Time Complexity: O(2ⁿ). 
  Only one traversal from 0 to (2ⁿ) is needed.
• Auxiliary Space: O(log x). 
  A space of (log x) is required for binary representation of (x)