15,922,574 members
Sign in
Sign in
Email
Password
Forgot your password?
Sign in with
home
articles
Browse Topics
>
Latest Articles
Top Articles
Posting/Update Guidelines
Article Help Forum
Submit an article or tip
Import GitHub Project
Import your Blog
quick answers
Q&A
Ask a Question
View Unanswered Questions
View All Questions
View C# questions
View C++ questions
View Visual Basic questions
View Javascript questions
View Python questions
discussions
forums
CodeProject.AI Server
All Message Boards...
Application Lifecycle
>
Running a Business
Sales / Marketing
Collaboration / Beta Testing
Work Issues
Design and Architecture
Artificial Intelligence
ASP.NET
JavaScript
Internet of Things
C / C++ / MFC
>
ATL / WTL / STL
Managed C++/CLI
C#
Free Tools
Objective-C and Swift
Database
Hardware & Devices
>
System Admin
Hosting and Servers
Java
Linux Programming
Python
.NET (Core and Framework)
Android
iOS
Mobile
WPF
Visual Basic
Web Development
Site Bugs / Suggestions
Spam and Abuse Watch
features
features
Competitions
News
The Insider Newsletter
The Daily Build Newsletter
Newsletter archive
Surveys
CodeProject Stuff
community
lounge
Who's Who
Most Valuable Professionals
The Lounge
The CodeProject Blog
Where I Am: Member Photos
The Insider News
The Weird & The Wonderful
help
?
What is 'CodeProject'?
General FAQ
Ask a Question
Bugs and Suggestions
Article Help Forum
About Us
Search within:
Articles
Quick Answers
Messages
Comments by Hivi Dino (Top 3 by date)
Hivi Dino
12-Apr-12 15:08pm
View
Thanks Andi For that declaration :)
Hivi Dino
31-Mar-12 10:44am
View
Ahmed i wondered when i saw you here :D ,Please Addy Tas Help us We Need your Help,The Algorithm that our Teacher has gave us is Too Little Bit,we can't write the correct code only by that Algorithm,This is The Algorithm that He gave us:
((
Evaluating Postfix Expression:
scan given postfix expression;
for each symbol in postfix
if operand
then push its value onto a stack S;
if operator then
Begin
pop operand2;
pop operand1;
apply operator to compute operand1 op operand2;
push result back onto stack S;
End
return value at top of stack;
Evaluating Prefix Expression :
reverse given prefix expression;
scan the reversed prefix expression;
for each symbol in reversed prefix
if operand then
push its value onto a stack S;
if operator then
begin
pop operand1;
pop operand2;
apply operator to compute operand1 op operand2;
push result back onto stack S;
end if
return value at top of stack;
))
Hivi Dino
31-Mar-12 10:05am
View
Hello ,I have the same problem,I also Need that code :D