OUT-OF-DATE! Read http://shootout.alioth.debian.org/      

- all benchmarks - n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive - all languages - BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

÷ BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

 Step 1 : Are the programs faster? At a glance.

This chart shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each chart bar shows, for one unidentified benchmark, how much the fastest program used compared to the fastest Zonnon Mono program.

Look at speed another way - look at a box plot of Time-used data.

 Step 2 : Are the programs faster? Approximately.

This table shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each table row shows, for one named benchmark, how much the fastest program used compared to the fastest Zonnon Mono program.

used what fraction? used how many times more?
Benchmark	Time	Memory	Code
n-body	1/2	4×	±
nsieve	±	3×	±

used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(CPU secs)	1/2	1/2	1/2	±	±	±	±

± read the measurements and then read the program source code.

 Step 3 : Are the programs faster? Measurements.

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ≈ CPU Load ~ speed and size.

For each named benchmark, measurements of the fastest program are shown for comparison against measurements of the fastest Zonnon Mono program.

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
n-body
	16.43		20,796	1420
Zonnon Mono	34.61		5,168	1524
nsieve
	2.98		24,380	392
Zonnon Mono	2.32		9,744	368
recursive
	0.88		19,680	411
Zonnon Mono	Failed
partial-sums
	0.97		19,312	485
Zonnon Mono	Failed
k-nucleotide
	1.74		22,368	1039
	No program
reverse-complement
	0.96		19,484	1086
	No program
mandelbrot
	0.84		19,344	454
	No program
fasta
	1.23		19,588	1207
	No program
pidigits
	2.14		25,384	461
	No program
regex-dna
	4.22		55,344	663
	No program
binary-trees
	0.93		20,128	536
	No program
spectral-norm
	1.02		19,560	500
	No program
nsieve-bits
	1.90		19,452	390
	No program

 Step 4 : Are there other programs for these benchmarks?

Remember - those are just the fastest and Zonnon Mono programs measured on this OS/machine. Check if there are other implementations of these benchmark programs for .

BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

Maybe one of those other programs is fastest on a different OS/machine.

 Step 5 : Are there other faster programs for these benchmarks?

Remember - those are just the fastest and Zonnon Mono programs measured on this OS/machine. Check if there are faster implementations of these benchmark programs for other programming languages.

n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive

Maybe one of those other programs is fastest on a different OS/machine.

  :  

Scala code runner version 2.7.1.final -- Copyright 2002-2008, LAMP/EPFL

Online book: Programming in Scala pdf

A Scala Tutorial for Java programmers pdf

Home Page: http://scala.epfl.ch/

Download: http://scala.epfl.ch/downloads/index.html

  Home   Conclusions   License   Help