Skip to main content

Integer to Binary in c

Objective : To convert the given integer to binary in C language.

Programming technique : The conversion of integer to binary can be done in many ways. I will demonstrate a very simple (possibly very unoptimised ) way which it is easy to understand.
This way involves using an array to store the remainder of the number when we divide it by 2. The remainder will be saved in array. We will start filling the array from the last and at last we will print the array.
This technique will convert integer number to binary using array, it may not be a true solution but you will get the picture.
we will use % modules operator to extract remainder. Then will reduce the number till it reaches 0. The array will be initialized to 0.

Code : 
#include<stdio.h>
int main()
{
    int p;
    printf("\n Enter a number=");
    scanf("%d",&p);
    bin(p);
}

void bin(int x)
{
    long b=0;
    int binary[20],i;
    for(i=0;i<20;i++)
    {
        binary[i]=0;//setting array to 0
    }
    i=19;// starting from last of array
    while(x>0)
    {

        binary[i]=x%2;//save remainder to array
        x=x/2; //reduce number
        i--;//moving index 
    }
    printf("\n Printing Binary=");
    for(i=0;i<20;i++)
    {
        printf("%d",binary[i]);
    }
}


one possible drawback of this technique is that you cant use the binary number directly  in calculations.
Note : The above method will store only 20 digits of binary.
Labels:

Popular posts from this blog

Find nth Prime Number in C++

c++ program to find prime numbers: The problem of finding prime number can be solved by checking all numbers, testing them for prime and then moving ahead. If you want to calculate nth prime. Then this can be done in a brutal way by checking the number one by one. This may sound odd, by there is no easy way then this  for prime numbers (Well Actually there are like Pollard's Rho Algorithm, Number Sieves or Shor's Quantum Algorithm, but we are talking about the one that most people may understand easily). There may be way to pre-calculate the prime numbers but that again is not sufficient. So how can we use c++ to create a program to find prime numbers.
Read more

Overloading Unary Operator in C++

In this Example I will demonstrate overloading a unary operator. The overloading is done in similar way as we did for binary operator. In this example I will be using a Vector Class. The operator we are going to over load is the unary "~" (tilde) operator. although you can use any unary overloadable operator. Method: In this example the overloaded operator will be the part of the class i.e. the over loaded definition will be a member function. (As we know overloading can be done using non member functions too). So the unary operator will not have any arguments in it. We will overload ~ operator so that it will reflect the vector so that its z component becomes x component and vice versa. So input vector will be 2i+3j+5k and its output vector will be 5i+3j+2k. although you can do anything you like. Code: # include < iostream > using namespace std ; class vector { int x , y , z ;      public : vector ( ) { x = y = z = 0 ; ...
Read more