Ad

Friday, December 07, 2007

Using a Stack to Reverse Numbers

Yeah, I heard many of you saying this and I know it’s no big deal to reverse a number and neither is it using stack to do so. I am writing this just to give you an example of how certain things in a program can be done using stacks. So, let’s move on…

As many of you already know, a stack is a Data Structure in which data can be added and retrieved both from only one end (same end). Data is stored linearly and the last data added is the first one to be retrieved, due to this fact it is also known as Last-In-First-Out data structure. For more info please read Data Structures: Introduction to Stacks.

Now, let’s talk about reversing a number, well reversing means to rearrange a number in the opposite order from one end to the other.

Suppose we have a number

12345

then its reverse will be

54321

Ok, now let’s have a look at the example program which does this:


  // Program in C++ to reverse
  // a number using a Stack

  // PUSH -> Adding data to the sat ck
  // POP -> Retrieving data from the stack

  #include<iostream.h>

  // stack class
  class stack
  {
    int arr[100];
    // 'top' will hold the
    // index number in the
    // array from which all
    // the pushing and popping
    // will be done
    int top;
  public:
    stack();
    void push(int);
    int pop();
  };


  // member functions
  // of the stack class
  stack::stack()
  {
    // initialize the top
    // position
    top=-1;
  }

  void stack::push(int num)
  {
    if(top==100)
    {
      cout<<"\nStack Full!\n";
      return;
    }

    top++;
    arr[top]=num;
  }

  int stack::pop()
  {
    if(top==-1)
    {
      return NULL;
    }

    return arr[top--];
  }
  // member function definition ends

  void main()
  {
    stack st;
    int num, rev_num=0;
    int i=1, tmp;

    cout<<"Enter Number: ";
    cin>>num;

    // this code will store
    // the individual digits
    // of the number in the
    // Stack
    while(num>0)
    {
      st.push(num%10);
      num/=10;
    }

    // code below will retrieve
    // digits from the stack
    // to create the reversed
    // number
    tmp=st.pop();
    while(tmp!=NULL)
    {
      rev_num+=(tmp*i);
      tmp=st.pop();
      i*=10;
    }

    cout<<"Reverse: "<<rev_num<<endl;
  }

The above code is pretty much straightforward and I leave it up to you to understand it!

P.S. If you experience any problems understanding it please first read the article Data Structures: Introduction to Stacks

Related Articles:

8 comments:

  1. I must say I really like your articles. Keep on the good work !

    ReplyDelete
  2. Anonymous9:47 AM

    Sir,

    It is an excellent program

    ReplyDelete
  3. Thanks to both of you...

    ReplyDelete
  4. I had started following your article 3 months back and till date every article i go through is a good learning experience. thanks.

    ReplyDelete
  5. @ Karrox,

    Thanks a lot!

    ReplyDelete
  6. This comment has been removed by a blog administrator.

    ReplyDelete
  7. Hello Jhon,

    If every time you keep searching for programs that you're in need of, every now and then you'll have to use such abusive languages.

    If only your mother had taught you to rather try to learn something that'll help in the long run instead of mere copy pasting thing, you wouldn't have told such things about someone else's mother.

    ReplyDelete
  8. Anonymous4:26 PM

    Am looking for following content related to stack:
    - using stack to resolve business case
    - using stack to solve divide and conquer

    ReplyDelete

You are free to comment anything, although you can comment as 'Anonymous' it is strongly recommended that you supply your name. Thank You.

Please don't use abusive language.