vitalif
/
langs-performance
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
17 Commits
1 Branch
0 Tags
156 KiB
Perl 24.4%
Shell 14.8%
C++ 11.9%
Java 10.2%
Erlang 6.4%
Other 32.3%
 
 
 
 
 
 
Go to file
Ivan Zahariev 0036820b92 Initial commit. Work still in progress 2016-07-27 13:43:14 +03:00
cpp-optimizations Initial commit 2016-02-04 21:32:08 +02:00
results Initial commit. Work still in progress 2016-07-27 13:43:14 +03:00
LICENSE Initial commit 2016-02-04 21:30:25 +02:00
README.md Update README.md 2016-07-14 22:46:07 +02:00
primes-non-std-lib.java Initial commit 2016-02-04 21:32:08 +02:00
primes.cpp Initial commit 2016-02-04 21:32:08 +02:00
primes.go no compiler hints 2016-07-14 22:24:04 +02:00
primes.java Initial commit 2016-02-04 21:32:08 +02:00
primes.js Initial commit 2016-02-04 21:32:08 +02:00
primes.php Initial commit 2016-02-04 21:32:08 +02:00
primes.pl Initial commit 2016-02-04 21:32:08 +02:00
primes.py Initial commit 2016-02-04 21:32:08 +02:00
run.sh Print a message when a compiler is skipped 2016-07-27 13:42:52 +03:00

README.md

langs-performance

C++ vs. Python vs. Perl vs. PHP vs. Java vs. NodeJS vs. Go performance benchmark

Blog articles:

The benchmarks here do not try to be complete, as they are showing the performance of the languages in one aspect, and mainly: loops, dynamic arrays with numbers, basic math operations.

The times include the interpretation/parsing phase for each language, but it’s so small that its significance is negligible. The math function is called 10 times, in order to have more reliable results. All scripts are using the very same algorithm to calculate the prime numbers in a given range. The correctness of the implementation is not so important, as we just want to check how fast the languages perform. The original Python algorithm was taken from http://www.daniweb.com/code/snippet216871.html.