C Program to Convert Binary Code of a Number into its Equivalent Gray’s Code without using Recursion

C Program to Convert Binary Code of a Number into its Equivalent Gray’s Code without using Recursion.

  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int bintogray(int);
  5.  
  6. int main ()
  7. {
  8.     int bin, gray;
  9.  
  10.     printf("Enter a binary number: ");
  11.     scanf("%d", &bin);
  12.     gray = bintogray(bin);
  13.     printf("The gray code of %d is %d\n", bin, gray);
  14.     return 0;
  15. }
  16.  
  17. int bintogray(int bin)
  18. {
  19.     int a, b, result = 0, i = 0;
  20.  
  21.     while (bin != 0)
  22.     {
  23.         a = bin % 10;
  24.         bin = bin / 10;
  25.         b = bin % 10;
  26.         if ((a && !b) || (!a && b))
  27.         {
  28.             result = result + pow(10, i);
  29.         }
  30.         i++;
  31.     }
  32.     return result;
  33. }

 

Comments

Post a Comment

Popular posts from this blog

C program to print Pascal triangle

     C program to print Pascal triangle    1 1 1 1 2 1 1 3 3 1 #include <stdio.h>   long factorial ( int ) ;   int main ( ) { int i , n , c ;   printf ( "Enter the number of rows you wish to see in pascal triangle \n " ) ; scanf ( "%d" ,& n ) ;   for ( i = 0 ; i < n ; i ++ ) { for ( c = 0 ; c <= ( n - i - 2 ) ; c ++ ) printf ( " " ) ;   for ( c = 0 ; c <= i ; c ++ ) printf ( "%ld " , factorial ( i ) / ( factorial ( c ) * factorial ( i - c ) ) ) ;   printf ( " \n " ) ; }   return 0 ; }   long factorial ( int n ) { int c ; long result = 1 ;   for ( c = 1 ; c <= n ; c ++ ) result = result * c ;   return result ; }
Read more

JavaScript

The JavaScript language Here we learn JavaScript, starting from scratch and go on to advanced concepts like OOP. We concentrate on the language itself here, with the minimum of environment-specific notes
Read more

C program to Calculate the Power of a Number Using Recursion

C program to Calculate the Power of a Number Using Recursion /* Source Code to calculate power using recursive function */ #include <stdio.h> int power ( int n1 , int n2 ); int main () { int base , exp ; printf ( "Enter base number: " ); scanf ( "%d" ,& base ); printf ( "Enter power number(positive integer): " ); scanf ( "%d" ,& exp ); printf ( "%d^%d = %d" , base , exp , power ( base , exp )); return 0 ; } int power ( int base , int exp ) { if ( exp != 1 ) return ( base * power ( base , exp - 1 )); }
Read more