Mathematical Expression Evaluator

Hi I am an experienced C/C++/Java developer with excellent software engineering skills. I would like to work on this mathematical expressions calculator and assure to deliver efficient solution because I have good knowledge on algorithms and data structures. My work experience includes internship at Google(2012) and working with several start-ups in Kenya to deliver android mobile and web solutions. Thanks and regards, Isaac

I am very proficient in c, c++. I have 15 years c++ developing experience now, and I have worked for 5 years. My work is online game developing, and mainly focus on server side, the language is c++ under linux. I used c++ to make many great projects, for example, I made the tools which can convert java files to c++ scripts which has the same effect, of course garbage collection included. I also made our own mobile game using c++, I even can show you the demo of client. Trust me, please let expert help you.

Hi, hope that everything goes well with you, I'm working on a very complex project that's why I cant bid on the project at the time. I place a bid for this project for 25$ + past 15$ + 10% of freelancer part. Hope that it's good for you. Best Regards, Marouane

the best way to evaluate a mathematical expression is to first change the postfix notation and then evaluate it. This is part of the main function and sample output. int main (int argc, const char* argv[]) { if (argc > 1) { std::cout << "Eval= " << argv[1] << std::endl; std::string posfix = fposfix(argv[1]); std::cout << "postfix= " << posfix << std::endl; std::cout << "Result= " << fevaluate(posfix) << std::endl; } else { std::cout << "Type " << argv[0] << " expr" <<std::endl; } } Eval= 6 * ( 5 - 3 ) postfix= 6 5 3 - * Result= 12 Eval= 3 + 4 * 2 / ( 1 - 5 ) ^ ( 2 ^ 3 ) postfix= 3 4 2 * 1 5 - 2 3 ^ ^ / + Result= 3.00012

Hello! I can help you with this mini calculator. I'm a good programmer and I have a good background in data structures. I'm looking forward hearing from you! Kind regards!

Hi, I would have the pleasure to do business with you. Algorithm optimization is one of my specialties, additional process optimization can be applied when necessary. I look forward hearing back from you soon. Best regards, Tamer

Hello there, I would like to be considered for this job as I have great working experience in algorithm design and development. Thanks, Ramesh

I read your project description and I think I can give you the well documented code. I already have a written code which converts infix string to postfix notation and then evaluates it using STL stack in C++.

Can you provide you a C++ function which takes inputs as Operand , operator Operand .... up to a maximum of predefined numbers of operands. stack can store the result as soon as equal sign is entered. This result will be stacked to resume the next set of operations on this result . Grouping of operations can also be provided.

Good Background in Mathematics and C/C++ Programming Language. Successfully implemented such projects including conversion and evaluation of infix to post and prefix expressions in C/C++.

I have been preparing for Programming Interviews for some time now. The problem described is one of the trivial problems for the preparation.

hi, I'm a programming student, I have a long time working with c++ so I will do the best for make what you'ŕe asking. actualy I'm tutor of c++ programming

Will provide highly efficient code for your project. Which will easy to maintain and scope for further enhancements.

It can be my debut on the freelancer.com. :) The work seems like a usual programming task on the first year of CS undergraduate programme.

I actually have done this type of program before in one of my CS classes. The project has already been completed. User enters the expression and it uses the stack to convert and then output new expression.

I have a Knack for coding .I love to solving problem, I want to do this Project ,please give me chance i will do my best and give you better result with in time . thank you.