University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page
Computer Science 477/677: Design and Analysis of Algorithms
Programming Problem: In Situ Sorting
Revised October 13, 2005.
-
Write an array implementation of stack of character.
-
Write a linked list implementation of stack of character.
Test each of those implementations in a program that changes
an algebraic expression in infix notation to an equivalent
expression in postfix notation.
The algorithm for this conversion is explained here.
When you write out the postfix expression, write the negation
operator as "~". Thus, the infix expression -a is converted to
the postfix expression a~
Postfix notation is also known as "reverse Polish." Many calculators
take postfix input, because no parentheses are necessary.
Some infix expressions.