racket

History

Matthew Flatt 482596754b change binary-tree to maybe correctly match the rules svn: r5532		2007-02-01 07:02:00 +00:00
..
ackermann.ss
ary.ss
binarytrees.ss	change binary-tree to maybe correctly match the rules	2007-02-01 07:02:00 +00:00
chameneos.ss
cheapconcurrency.ss
echo.ss
except.ss
fannkuch.ss
fasta.ss
fibo.ss
hash.ss
hash2.ss
heapsort.ss	some simplifications	2006-10-26 06:56:56 +00:00
k-nucleotide.ss	benchmark impl. is not actually based on the Ruby version	2007-02-01 06:15:46 +00:00
lists.ss
mandelbrot.ss
matrix.ss
moments.ss	some simplifications	2006-10-26 06:56:56 +00:00
nbody.ss	some simplifications	2006-10-26 06:56:56 +00:00
nestedloop.ss
nsieve.ss
nsievebits.ss
partialsums.ss	some simplifications	2006-10-26 06:56:56 +00:00
pidigits.ss
pidigits1.ss
random.ss	some simplifications	2006-10-26 06:56:56 +00:00
README.txt
recursive.ss	some simplifications	2006-10-26 06:56:56 +00:00
regexmatch.ss
regexpdna.ss	some simplifications	2006-10-26 06:56:56 +00:00
reversecomplement.ss	mostly improvements to run.ss benchmark-running script	2007-01-22 03:18:51 +00:00
reversefile.ss
run.ss	add another missing benchmark	2007-01-29 14:00:47 +00:00
sieve.ss
spectralnorm.ss	add attribution	2007-01-29 14:01:29 +00:00
spellcheck.ss
strcat.ss
sumcol-input.txt	mostly improvements to run.ss benchmark-running script	2007-01-22 03:18:51 +00:00
sumcol.ss
wc.ss
wordfreq.ss

README.txt

The program "run" should kknow how to run each benchmark with its
standard input value. So run <benchmark.ss> like this:

   mzscheme -qu run.ss <benchmark.ss>