vitalif
/
langs-performance
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
53 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 5851ea6456 LinkedList info 2016-09-22 22:15:51 +03:00
cpp-optimizations Initial commit 2016-02-04 21:32:08 +02:00
java-optimizations LinkedList info 2016-09-22 22:15:51 +03:00
results Add Java optimization notes 2016-09-19 18:19:09 +03:00
LICENSE Initial commit 2016-02-04 21:30:25 +02:00
README.md New benchmark method + new blog article 2016-09-10 09:51:53 +03:00
primes-alt.java Limit running time by an ENV variable 2016-09-07 21:34:42 +03:00
primes.cpp Limit running time by an ENV variable 2016-09-07 21:47:03 +03:00
primes.go Limit running time by an ENV variable 2016-09-07 21:58:43 +03:00
primes.java Limit running time by an ENV variable 2016-09-07 21:34:42 +03:00
primes.js Limit running time by an ENV variable 2016-09-07 22:04:46 +03:00
primes.php Limit running time by an ENV variable 2016-09-08 17:44:06 +03:00
primes.pl Limit running time by an ENV variable 2016-09-08 17:46:47 +03:00
primes.py Limit running time by an ENV variable 2016-09-08 17:50:42 +03:00
primes.rb Limit running time by an ENV variable 2016-09-08 17:57:49 +03:00
run.sh Rename some language titles to match the previous benchmark results 2016-09-09 23:17:35 +03:00

README.md

langs-performance

C++ vs. Python vs. Perl vs. PHP vs. Java vs. NodeJS vs. Go vs. Ruby 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 programs run for 90 wall-clock seconds and there are 6 identical runs, 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.