Branimir Maksimovic wrote:

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

And the author comments his program -- This is a purely functional solution to the problem. -- 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. http://brand.yahoo.com/cybergivingweek2005/