> I need a very brief algorithm of following code. It is Infix to Postfix conversion using stacks in C++?

I need a very brief algorithm of following code. It is Infix to Postfix conversion using stacks in C++?

Posted at: 2014-12-18 
int main()

{

string infix, postfix;

Stack obj;

cout << "This is a Infix to Postfix Expression converter." << endl;

cout << "Enter your Infix Expression: ";

cin >> infix;



for (int i = 0; i
{

if (isdigit(infix[i]) || isalpha(infix[i]))

{

postfix += infix[i];

}

else if (infix[i] == '+' || infix[i] == '-' || infix[i] == '*' || infix[i] == '/' || infix[i] == '^')

{

while (obj.isp(obj.top()) >= obj.icp(infix[i]))

{

postfix += obj.pop();

}

if (obj.isp(obj.top()) < obj.icp(infix[i]))

{

obj.push(infix[i]);

}}}

while (!obj.is_empty())

{

postfix += obj.pop();

}

cout << postfix<
system("Pause");

return 0;

}