Post/Prefix Calculator

This was a project I decided to do during my free time to try and understand how postfix and prefix notations worked in computer science. I implements this by using a Stack to utilize my knowledge of Java to learn this. I find it easier to learn computer science things by coding it out.

Doing this project also helped me understand how recursions work on runtime. I learnt that recursive functions utilize the IDE on runtime and creates a runtime stack which keeps stacking the called method until a base case has been met, then it will ‘pop’ outputs from the top to bottom until the all the calls have been returned. This helped me better understand and implemented my next project.(sudoku solver)

Source: tony/post-prefix-calculator