I can do an Infix to Postfix conversion on paper pretty well now, yet for this assignment, even with the algorithm Cheng attempted to explain in class, I can't figure out how to convert infix to postfix in C++. Can anyone possibly offer any assistance or general tips to help? Thanks
Joined: Sun 08-18-2002 10:33AM Posts: 751 Location: Kansas City, KS
Source: CompSci Building
Well, if you're still using the same book I used, they give a complete pseudocode outline of the algorithm starting on page 364.
_________________ It is by caffeine alone I set my mind in motion.
It is by the beans of Java the thoughts acquire speed,
the hands acquire shaking, the shaking becomes a warning.
It is by caffeine alone I set my mind in motion.
What is the algorithm that she presented to the class?
I'd like to help out, but I don't want to just give you guys the answer. I ran into too many people in my day who made it to upper level CS classes and didn't have a damn clue what they were doing.
Page 381 is correct. It's just as good if not better than anything given in class. It's what I used. Probably the biggest hurdle is just getting it to deal with presedence of the +-*/ operators. And it never hurts to visit the lab with the tudors. I do it about once each assignment. I don't know if it's just me being away from distraction or some of the help I get, but I just work better there. I reccomend it.
_________________ On the other hand, there are five more fingers.
Users browsing this forum: No registered users and 2 guests
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum