Gray to Binary and Binary to Gray conversion
Last Updated :
03 Feb, 2025
Binary Number is the default way to store numbers, but in many applications, binary numbers are difficult to use and a variety of binary numbers is needed. This is where Gray codes are very useful.Â
Gray code has a property that two successive numbers differ in only one bit because of this property gray code does the cycling through various states with minimal effort and is used in K-maps, error correction, communication, etc.
How to Convert Binary To Gray and Vice Versa?Â
Binary : 0011
Gray : 0010
Binary : 01001
Gray : 01101
Binary to Gray conversion :Â
- The Most Significant Bit (MSB) of the gray code is always equal to the MSB of the given binary code.
- Other bits of the output gray code can be obtained by XORing binary code bit at that index and previous index.
Binary code to gray code conversionGray to binary conversion :
- The Most Significant Bit (MSB) of the binary code is always equal to the MSB of the given gray code.
- Other bits of the output binary code can be obtained by checking the gray code bit at that index. If the current gray code bit is 0, then copy the previous binary code bit, else copy the invert of the previous binary code bit.
Gray code to binary code conversion
Below is the implementation of the above approach:
C++
// C++ program for Binary To Gray
// and Gray to Binary conversion
#include <bits/stdc++.h>
using namespace std;
// Function to find xor of two
// bits represented as character.
char xorChar(char a, char b) {
return (a == b) ? '0' : '1';
}
// Function to flip a bit
// represented as character.
char flip(char c) {
return (c == '0') ? '1' : '0';
}
// function to convert binary string
// to gray string
string binToGrey(string binary) {
string gray = "";
// MSB of gray code is same as binary code
gray += binary[0];
// Compute remaining bits, next bit is computed by
// doing XOR of previous and current in Binary
for (int i = 1; i < binary.length(); i++) {
// Concatenate XOR of previous bit
// with current bit
gray += xorChar(binary[i - 1], binary[i]);
}
return gray;
}
// function to convert gray code string
// to binary string
string greyToBin(string gray) {
string binary = "";
// MSB of binary code is same as gray code
binary += gray[0];
// Compute remaining bits
for (int i = 1; i < gray.length(); i++) {
// If current bit is 0, concatenate
// previous bit
if (gray[i] == '0')
binary += binary[i - 1];
// Else, concatenate invert of
// previous bit
else
binary += flip(binary[i - 1]);
}
return binary;
}
int main() {
string binary = "01001";
cout << binToGrey(binary) << endl;
string gray = "01101";
cout << greyToBin(gray) << endl;
return 0;
}
// Java program for Binary To Gray
// and Gray to Binary conversion
class GfG {
// Function to find xor of two
// bits represented as character.
static char xorChar(char a, char b) {
return (a == b) ? '0' : '1';
}
// Function to flip a bit
// represented as character.
static char flip(char c) {
return (c == '0') ? '1' : '0';
}
// function to convert binary string
// to gray string
static String binToGrey(String binary) {
String gray = "";
// MSB of gray code is same as binary code
gray += binary.charAt(0);
// Compute remaining bits, next bit is computed by
// doing XOR of previous and current in Binary
for (int i = 1; i < binary.length(); i++) {
// Concatenate XOR of previous bit
// with current bit
gray += xorChar(binary.charAt(i - 1), binary.charAt(i));
}
return gray;
}
// function to convert gray code string
// to binary string
static String greyToBin(String gray) {
String binary = "";
// MSB of binary code is same as gray code
binary += gray.charAt(0);
// Compute remaining bits
for (int i = 1; i < gray.length(); i++) {
// If current bit is 0, concatenate
// previous bit
if (gray.charAt(i) == '0')
binary += binary.charAt(i - 1);
// Else, concatenate invert of
// previous bit
else
binary += flip(binary.charAt(i - 1));
}
return binary;
}
public static void main(String[] args) {
String binary = "01001";
System.out.println(binToGrey(binary));
String gray = "01101";
System.out.println(greyToBin(gray));
}
}
# Python program for Binary To Gray
# and Gray to Binary conversion
# Function to find xor of two
# bits represented as character.
def xorChar(a, b):
return '0' if a == b else '1'
# Function to flip a bit
# represented as character.
def flip(c):
return '1' if c == '0' else '0'
# function to convert binary string
# to gray string
def binToGrey(binary):
gray = ""
# MSB of gray code is same as binary code
gray += binary[0]
# Compute remaining bits, next bit is computed by
# doing XOR of previous and current in Binary
for i in range(1, len(binary)):
# Concatenate XOR of previous bit
# with current bit
gray += xorChar(binary[i - 1], binary[i])
return gray
# function to convert gray code string
# to binary string
def greyToBin(gray):
binary = ""
# MSB of binary code is same as gray code
binary += gray[0]
# Compute remaining bits
for i in range(1, len(gray)):
# If current bit is 0, concatenate
# previous bit
if gray[i] == '0':
binary += binary[i - 1]
# Else, concatenate invert of
# previous bit
else:
binary += flip(binary[i - 1])
return binary
if __name__ == "__main__":
binary = "01001"
print(binToGrey(binary))
gray = "01101"
print(greyToBin(gray))
// C# program for Binary To Gray
// and Gray to Binary conversion
using System;
using System.Text;
class GfG {
// Function to find XOR of two
// bits represented as characters
static char xorChar(char a, char b) {
return (a == b) ? '0' : '1';
}
// Function to flip a bit
// represented as a character
static char flip(char c) {
return (c == '0') ? '1' : '0';
}
// Function to convert binary
// string to gray string
static string binToGrey(string binary) {
StringBuilder gray = new StringBuilder();
// MSB of gray code is
// same as binary code
gray.Append(binary[0]);
// Compute remaining bits
for (int i = 1; i < binary.Length; i++) {
gray.Append(xorChar(binary[i - 1], binary[i]));
}
return gray.ToString();
}
// Function to convert gray code
// string to binary string
static string greyToBin(string gray) {
StringBuilder binary = new StringBuilder();
// MSB of binary code is same as gray code
binary.Append(gray[0]);
// Compute remaining bits
for (int i = 1; i < gray.Length; i++) {
if (gray[i] == '0')
binary.Append(binary[i - 1]);
else
binary.Append(flip(binary[i - 1]));
}
return binary.ToString();
}
static void Main() {
string binary = "01001";
Console.WriteLine(binToGrey(binary));
string gray = "01101";
Console.WriteLine(greyToBin(gray));
}
}
// JavaScript program for Binary To Gray
// and Gray to Binary conversion
// Function to find xor of two
// bits represented as character.
function xorChar(a, b) {
return (a === b) ? '0' : '1';
}
// Function to flip a bit
// represented as character.
function flip(c) {
return (c === '0') ? '1' : '0';
}
// function to convert binary string
// to gray string
function binToGrey(binary) {
let gray = "";
// MSB of gray code is same as binary code
gray += binary[0];
// Compute remaining bits, next bit is computed by
// doing XOR of previous and current in Binary
for (let i = 1; i < binary.length; i++) {
// Concatenate XOR of previous bit
// with current bit
gray += xorChar(binary[i - 1], binary[i]);
}
return gray;
}
// function to convert gray code string
// to binary string
function greyToBin(gray) {
let binary = "";
// MSB of binary code is same as gray code
binary += gray[0];
// Compute remaining bits
for (let i = 1; i < gray.length; i++) {
// If current bit is 0, concatenate
// previous bit
if (gray[i] === '0')
binary += binary[i - 1];
// Else, concatenate invert of
// previous bit
else
binary += flip(binary[i - 1]);
}
return binary;
}
let binary = "01001";
console.log(binToGrey(binary));
let gray = "01101";
console.log(greyToBin(gray));
Time Complexity: O(n), where n is length of the binary string.
Auxiliary Space: O(n)
If the binary code and gray code is given in integer format, then we can use bitwise operators to convert the codes. Below is the implementation using bitwise operators:
C++
// C++ program for Binary To Gray
// and Gray to Binary conversion
#include <bits/stdc++.h>
using namespace std;
int binToGrey(int n) {
return n ^ (n >> 1);
}
int greyToBin(int n) {
int res = n;
while (n > 0) {
n >>= 1;
res ^= n;
}
return res;
}
int main() {
int binary = 3;
cout << binToGrey(binary) << endl;
int gray = 2;
cout << greyToBin(gray) << endl;
return 0;
}
// Java program for Binary To Gray
// and Gray to Binary conversion
class GfG {
// Function to convert binary to gray
static int binToGrey(int n) {
return n ^ (n >> 1);
}
// Function to convert gray to binary
static int greyToBin(int n) {
int res = n;
while (n > 0) {
n >>= 1;
res ^= n;
}
return res;
}
public static void main(String[] args) {
int binary = 3;
System.out.println(binToGrey(binary));
int gray = 2;
System.out.println(greyToBin(gray));
}
}
# Python program for Binary To Gray
# and Gray to Binary conversion
# Function to convert binary to gray
def binToGrey(n):
return n ^ (n >> 1)
# Function to convert gray to binary
def greyToBin(n):
res = n
while n > 0:
n >>= 1
res ^= n
return res
if __name__ == "__main__":
binary = 3
print(binToGrey(binary))
gray = 2
print(greyToBin(gray))
// C# program for Binary To Gray
// and Gray to Binary conversion
using System;
class GfG {
// Function to convert binary to gray
static int binToGrey(int n) {
return n ^ (n >> 1);
}
// Function to convert gray to binary
static int greyToBin(int n) {
int res = n;
while (n > 0) {
n >>= 1;
res ^= n;
}
return res;
}
static void Main() {
int binary = 3;
Console.WriteLine(binToGrey(binary));
int gray = 2;
Console.WriteLine(greyToBin(gray));
}
}
// JavaScript program for Binary To Gray
// and Gray to Binary conversion
// Function to convert binary to gray
function binToGrey(n) {
return n ^ (n >> 1);
}
// Function to convert gray to binary
function greyToBin(n) {
let res = n;
while (n > 0) {
n >>= 1;
res ^= n;
}
return res;
}
let binary = 3;
console.log(binToGrey(binary));
let gray = 2;
console.log(greyToBin(gray));
Time Complexity:
- For binary to gray conversion: O(1)
- For gray to binary conversion: O(log(n)), as n is a decimal number and number of bits is approximately log(n).
Auxiliary Space: O(1)
Related Article:
Generate n-bit Gray Codes
Similar Reads
Bitwise Algorithms Bitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Introduction to Bitwise Algorithms - Data Structures and Algorithms Tutorial Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0 or 1. In our world, we usually with numbers using the decimal base. In other words. we use the digit 0 to 9 However, there are other number representations that can be quite use
15+ min read
Bitwise Operators in C In C, bitwise operators are used to perform operations directly on the binary representations of numbers. These operators work by manipulating individual bits (0s and 1s) in a number.The following 6 operators are bitwise operators (also known as bit operators as they work at the bit-level). They are
6 min read
Bitwise Operators in Java In Java, Operators are special symbols that perform specific operations on one or more than one operands. They build the foundation for any type of calculation or logic in programming.There are so many operators in Java, among all, bitwise operators are used to perform operations at the bit level. T
6 min read
Python Bitwise Operators Python bitwise operators are used to perform bitwise calculations on integers. The integers are first converted into binary and then operations are performed on each bit or corresponding pair of bits, hence the name bitwise operators. The result is then returned in decimal format.Note: Python bitwis
5 min read
JavaScript Bitwise Operators In JavaScript, a number is stored as a 64-bit floating-point number but bitwise operations are performed on a 32-bit binary number. To perform a bit-operation, JavaScript converts the number into a 32-bit binary number (signed) and performs the operation and converts back the result to a 64-bit numb
5 min read
All about Bit Manipulation Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementa
14 min read
What is Endianness? Big-Endian & Little-Endian Computers operate using binary code, a language made up of 0s and 1s. This binary code forms the foundation of all computer operations, enabling everything from rendering videos to processing complex algorithms. A single bit is a 0 or a 1, and eight bits make up a byte. While some data, such as cert
5 min read
Bits manipulation (Important tactics) Prerequisites: Bitwise operators in C, Bitwise Hacks for Competitive Programming, Bit Tricks for Competitive Programming Table of Contents Compute XOR from 1 to n (direct method)Count of numbers (x) smaller than or equal to n such that n+x = n^xHow to know if a number is a power of 2?Find XOR of all
15+ min read
Easy Problems on Bit Manipulations and Bitwise Algorithms
Binary representation of a given numberGiven an integer n, the task is to print the binary representation of the number. Note: The given number will be maximum of 32 bits, so append 0's to the left if the result string is smaller than 30 length.Examples: Input: n = 2Output: 00000000000000000000000000000010Input: n = 0Output: 000000000000
6 min read
Count set bits in an integerWrite an efficient program to count the number of 1s in the binary representation of an integer.Examples : Input : n = 6Output : 2Binary representation of 6 is 110 and has 2 set bitsInput : n = 13Output : 3Binary representation of 13 is 1101 and has 3 set bits[Naive Approach] - One by One CountingTh
15+ min read
Add two bit stringsGiven two binary strings s1 and s2 consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings.Note: The input strings may contain leading zeros but the output string should not have any leading zeros.Examples:Input: s1 = "1101", s2 = "111"Output: 10100Explanation: "1
1 min read
Turn off the rightmost set bitGiven an integer n, turn remove turn off the rightmost set bit in it. Input: 12Output: 8Explanation : Binary representation of 12 is 00...01100. If we turn of the rightmost set bit, we get 00...01000 which is binary representation of 8Input: 7 Output: 6 Explanation : Binary representation for 7 is 0
7 min read
Rotate bits of a numberGiven a 32-bit integer n and an integer d, rotate the binary representation of n by d positions in both left and right directions. After each rotation, convert the result back to its decimal representation and return both values in an array as [left rotation, right rotation].Note: A rotation (or cir
7 min read
Compute modulus division by a power-of-2-numberGiven two numbers n and d where d is a power of 2 number, the task is to perform n modulo d without the division and modulo operators.Input: 6 4Output: 2 Explanation: As 6%4 = 2Input: 12 8Output: 4Explanation: As 12%8 = 4Input: 10 2Output: 0Explanation: As 10%2 = 0Approach:The idea is to leverage bi
3 min read
Find the Number Occurring Odd Number of TimesGiven an array of positive integers. All numbers occur an even number of times except one number which occurs an odd number of times. Find the number in O(n) time & constant space. Examples : Input : arr = {1, 2, 3, 2, 3, 1, 3}Output : 3 Input : arr = {5, 7, 2, 7, 5, 2, 5}Output : 5 Recommended
12 min read
Program to find whether a given number is power of 2Given a positive integer n, the task is to find if it is a power of 2 or not.Examples: Input : n = 16Output : YesExplanation: 24 = 16Input : n = 42Output : NoExplanation: 42 is not a power of 2Input : n = 1Output : YesExplanation: 20 = 1Approach 1: Using Log - O(1) time and O(1) spaceThe idea is to
12 min read
Find position of the only set bitGiven a number n containing only 1 set bit in its binary representation, the task is to find the position of the only set bit. If there are 0 or more than 1 set bits, then return -1. Note: Position of set bit '1' should be counted starting with 1 from the LSB side in the binary representation of the
8 min read
Check for Integer OverflowGiven two integers a and b. The task is to design a function that adds two integers and detects overflow during the addition. If the sum does not cause an overflow, return their sum. Otherwise, return -1 to indicate an overflow.Note: You cannot use type casting to a larger data type to check for ove
7 min read
Find XOR of two number without using XOR operatorGiven two integers, the task is to find XOR of them without using the XOR operator.Examples : Input: x = 1, y = 2Output: 3Input: x = 3, y = 5Output: 6Approach - Checking each bit - O(log n) time and O(1) spaceA Simple Solution is to traverse all bits one by one. For every pair of bits, check if both
8 min read
Check if two numbers are equal without using arithmetic and comparison operatorsGiven two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The idea is to use XOR operator. XOR of two numbers is 0 if the numbers are the same, otherwise non-zero. C++ // C++ program to check if two numbers // a
8 min read
Detect if two integers have opposite signsGiven two integers a and b, the task is to determine whether they have opposite signs. Return true if the signs of the two numbers are different and false otherwise.Examples:Input: a = -5, b = 10Output: trueExplanation: One number is negative and the other is positive, so their signs are different.I
9 min read
Swap Two Numbers Without Using Third VariableGiven two variables a and y, swap two variables without using a third variable. Examples: Input: a = 2, b = 3Output: a = 3, b = 2Input: a = 20, b = 0Output: a = 0, b = 20Input: a = 10, b = 10Output: a = 10, b = 10Table of ContentUsing Arithmetic OperatorsUsing Bitwise XORBuilt-in SwapUsing Arithmeti
6 min read
Russian Peasant (Multiply two numbers using bitwise operators)Given two integers a and b, the task is to multiply them without using the multiplication operator. Instead of that, use the Russian Peasant Algorithm.Examples:Input: a = 2, b = 5Output: 10Explanation: Product of 2 and 5 is 10.Input: a = 6, b = 9Output: 54Explanation: Product of 6 and 9 is 54.Input:
4 min read