The goal of this project is to develop a set of algorithms implemented in many different languages including compiled and interpreted.

Thoose test will allow us to know how much will an application be improved if implemented into another language.

The tests are compared with a crude standard C. And the algorithm is initially implemented in Python and ported to all the others languages.

Please, if you run the tests, send me the results at jacobidiego(at)gmail.com

Any contributions are welcomed.

The next results are promediated from all runs and may vary on the algorithm used and the parameters passed.

Results for Quine-MacCLusky Algorithm:

"A procedural minterms reduction algorithm for logic ecuations, similar in function to Karnaugh"

Python is 34 times slower than C.

C++ is 3 times slower than .C

Note that, Python efficiency varies too much depending on the number of variables to manipulate. Plain Standard C is a pain to develop, most developers uses APIs like GLib to make this task done.

Another project aiming to bench languages is at: http://shootout.alioth.debian.org/