[Haskell-cafe] Re: Haskell Speed

Isaac Gouy igouy at yahoo.com
Tue Dec 27 23:12:01 EST 2005

Branimir Maksimovic wrote: 
> Of course, first example uses [String] instead of
> as other languages do. Imagine C program does not
> hash,rather list, how it will perform:)

And the author comments his program
-- This is a purely functional solution to the
-- An alternative which keeps a mutable table of
occurences would
-- be faster. 

We'll be happy to also show a Haskell program that
uses Data.HashTable - first, someone needs to
contribute that program.

> I didn't look further after that. 

Ideal - you may criticize without the risk that others
will criticize what you do.

Yahoo! for Good - Make a difference this year. 

More information about the Haskell-Cafe mailing list