postfix-expression

This program shows how to convert an infix expression to postfix expression. Before proceeding to program, first understand what is difference between infix expression and postfix expression. Infix notation: X + Y. Operators are written in-between their operands. Postfix notation (also known as “Reverse Polish notation”) : X Y + . Operators are written after […]

Read More »

The following program prints first 10 automorphic number.  I am giving you all brief introduction about what actually automorphic numbers are, assuming that some of you might not be aware about that.  In mathematics an automorphic number (sometimes referred to as a circular number) is a number whose square “ends” in the same digits as number itself. For example, 52 = 25, 62 = 36, 762 = […]

Read More »