How to: Transform a Mathematical Expression from Infix Writing to Postfix Writing in C++

Postfix writing (Reverse Polish Form) was made by Polish mathematician Jan Łukasiewicz. Particularities of this form of writing mathematical expressions are presented in […]. An algorithm for transforming a writing mathematical expressions from infix to postfix writing was developed by Edsger Dijkstra (Dijkstra Shunting Algorithm). Algorithm requires:

Read More →
How to: Evaluate a Mathematical Expression in Postfix Writing in C++

Postfix writing […] is a form of representation of mathematical expressions in which arithmetic operatorsare written specified by operands.Advantages of postfix writing over prefix and infix writing: Highlights clear policy of making operations; Brackets for forcing priority for implementing operators are not necessary; Evaluations are easily performed by computer. Algorithm for evaluation of an expression […]

Read More →
C and C++ library of functions and procedures for matrix (bidimensional arrays) processing – Introduction

Library source: C and C++ library of functions and procedures for matrix processing Language: C / C++Date: 04.2002Authors: Catalin Boja si Niculescu SilviuLicense: Creative Commons Attribution 3.0 License This post main objective is to tackle a series of aspects regarding the creation of a library that contains functions necessary in resolving the problems with matrices. […]

Read More →