Hi all,
I've implemented the 'pfannkuchen' algorithm for the fannkuch-redux benchmark
on shootout.alioth.debian.org, since this is the only remaining benchmark
without a Racket attempt. It seemed like a fun newbie project.
I'd appreciate any optimization hints or general comments and criticism
Seems like the racket entries in the Computer Language Benchmarks Game
has no fannkuch-redux entry. Isaac (the maintainer) said that we used
to have one, but the problem was changed (introduced a checksum).
There's also a nice description of a parallel solution on the problem
description page:
2 matches
Mail list logo
