You may want to use a mutable array. >The performance may suffer from the memory allocation for the list. I >wonder if it's possible to make Haskell implementation work faster >without changing the algorithm (there's are actually a few tricks to >make it work faster, but neither implementations have these >optimizations). >I'm interested not in particular algorithm performance but rather in >performance of its implementations in various languages. I compiled >the Haskell implementation in GHC (Haskell Platform 2009.2.0.2), which >is the latest available from the site.
If you are interested in its performance in various languages you may want to implement the Bubble Sort the "best" way in each language. -- Regards, Casey _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
