This is my javaJava implementation (O(n)\$O(n)\$) about how to calculate infix expression with no parenthesis.
For example, when we input "3 + 4 * 4 / 8", we will get a double type answer is 5.0. Here to make the algorithm simple, we don't consider any parenthesis in the expression. Below is my code.
I think my implementation is kind of tedious and long. Can anyone give me some advice to makeon making it more cleancleaner?