Infix Expression Evaluation Technique using Indexing Algorithm
Here is the document link below to understand more clearly about indexing algorithm which is different from traditional Shunting-Yard Algorithm designed by Sir. Edsger W. Dijkstra (Dutch System Scientist, Programmer) and pioneer in computing science. In Shunting-Yard Algorithm Infix is first converted to Postfix Notation and then evaluated. Here we can directly evaluate it without converting into postfix expression. But still it has some limitations like, it is difficult to evaluate infix expression which contain parenthesis '(', ')'. So as of now my indexing algorithm works fine for Non Parenthesis Infix Expression. For basic Arithematic operations like '+', '-', '*', '/' this shows its best in Time Complexity. Link: Infix Expression Evaluation using Indexing Algorithm