Skip to main content

Reversing a Number in C

Objective : You are given a  number and you have to find the reverse of the given number in C. reverse of 1234 will be 4321.

Programming logic: The logic lies in constructing the reverse numbers from the digits of the given number. So we extract each digit with % modulus operator and then build the number up.To build the number we simply multiply the reverse number by 10 and then add the next remainder to it.
Like 1234:
1234%10=4 (remainder). rev=4.
123%10= 3. rev=4x10+3=43.
12%10=2 rev=43x10+2=432.
1%10=1 rev=432x10+1=4321.


Code: 
#include<stdio.h>
int main()
{
    int k;
   printf("\n enter a number=");
   scanf("%d",&k);
   printf("\n Reverse of the number is=%d",reverse(k));
   return 0;
}
int reverse(int x)
{
    int ans=0,r;
    while( x > 0 )
    {
        r=x%10;//extract last digit
        ans=ans*10+r;// multiply by 10 and then add the remainder
          x=x/10;//reduce number
    }
   return(ans);

}
Labels:

Popular posts from this blog

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

Program to find nth Prime number in C

Objective: To print any Prime number in C.  This task may sound easy but is a very good exercise to help optimize CPU intensive programs. Finding Prime number is a very CPU hogging task and it becomes even more dreaded as the number starts to grow. Lets say we want to find 30001th prime. how will we find it?? Here is the program. Programming logic : The easiest method is to check if the given number N is divisible by any number from 2 to N-1. But it may be noted that we don't need to go beyond the number that is square root of N.  why?? lets have a look. Say we are testing number 49 for prime number. Our objective is to find any number that may divide it. so we start from 2,3,4 etc. As soon as we cross 7 there will be no number that will divide 49, if there was we have got it earlier since it will be smaller then 7.  Get it? another example 64 : 2x32 4x16 8x8 16x4 32x2 as you can see when we pass number 8 we don't need to test as the number that will come ,...
Read more