This C program, using iteration, evaluates the gray code equivalent of a binary number. A gray is also represented using 0s and 1s. The speciality of gray code is that only one bit is changed in 2 consecutive numbers, say 3 and 4.
Here is the source code of the C program to display a linked list in reverse. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

/*
* C Program to Convert Binary Code of a Number into its Equivalent
* Gray's Code without using Recursion
*/
#include <stdio.h>
#include <math.h>

int bintogray(int);

int main ()
{
int bin, gray;

printf("Enter a binary number: ");
scanf("%d", &bin);
gray = bintogray(bin);
printf("The gray code of %d is %d\n", bin, gray);
return 0;
}

int bintogray(int bin)
{
int a, b, result = 0, i = 0;

while (bin != 0)
{
a = bin % 10;
bin = bin / 10;
b = bin % 10;
if ((a && !b) || (!a && b))
{
result = result + pow(10, i);
}
i++;
}
return result;
}


$ cc pgm26.c -lm
$ a.out
Enter a binary number: 1111001010
The gray code of 1111001010 is 1000101111