Gray to Binary and Binary to Gray conversion
Last Updated :
23 Jul, 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
Binary To Gray Code Equivalent | DSA Problem
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise 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
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem