Inicio Explorar Axuda
Rexistro Iniciar sesión
trizen
/
language-benchmarks
Seguir 1
Destacar 0
Fork 0
Ficheiros Incidencias 0 Pull Requests 0 Wiki

A simple benchmark system for compiled and interpreted languages.

Rama: master
Ramas Etiquetas
language-ben...
ZIP TAR.GZ
trizen 187d7294e1 Merge branch 'master' of github.com:trizen/language-benchmarks %!s(int64=3) %!d(string=hai) anos
Compiled e8b692fdcb - Modified the "coin-sums" test to take numbers from command-line arguments. %!s(int64=8) %!d(string=hai) anos
Interpreted 187d7294e1 Merge branch 'master' of github.com:trizen/language-benchmarks %!s(int64=3) %!d(string=hai) anos
Reports d355de9122 modified: Reports/create_final_report.pl %!s(int64=6) %!d(string=hai) anos
Stats 51ca52231d new file: Interpreted/lev-distance-recursive/lev.clj %!s(int64=3) %!d(string=hai) anos
.gitignore 412bc7f21a Initial commit %!s(int64=9) %!d(string=hai) anos
LICENSE 412bc7f21a Initial commit %!s(int64=9) %!d(string=hai) anos
README.md 19d2f43e68 Update README.md %!s(int64=7) %!d(string=hai) anos
benchmark.pl 7ccd1a3379 - Updated reports. %!s(int64=6) %!d(string=hai) anos
update_names.sf 7ccd1a3379 - Updated reports. %!s(int64=6) %!d(string=hai) anos

README.md

Performance comparison of programming languages

A simple benchmark system with support for compiled and interpreted languages, generating CSV reports.

Overview

Overview

Ackermann function (ack(3,9))

Ackermann recursive

Tak function (tak(30,22,12))

Tak function

35th Fibonacci number (recursive)

Fibonacci recursive

Mutual recursion (F(130); M(130))

Mutual recursion

Levenshtein distance (recursive)

Levenshtein Distance

The LCS problem (recursive)

LCS

Coin sums (recursive)

Coin sums

Man or boy (mob(12))

Man or boy

The y-axis is measuring the average execution time of a process, in seconds. Lower values are better.