[Haskell-cafe] Shootout rankings

[Chris Kuklewicz]

I have added the debugged non-memory-leaking and now sped-up-with-trees
version of the fasta code to the wiki:

http://haskell.org/hawiki/FastaEntra

This will be submitted soon.  I do not think this is a good candidate
for lines-of-code compression/obfuscation.

In speed this entry runs 5.0 times faster than the original
memory-leaking one (on my powerbook G4 with OS 10.4.4)

It runs in 1.8 MB of RSIZE instead of the leaking 339 MB.

I notice the OCaml #2 version uses an array lookup instead of a binary
tree.  Hmmm....

-- 
Chris