On Fri, Jan 14, 2005 at 09:17:41AM +0100, Gracjan Polak wrote: > This algorithm seems not effective, length, take, drop and (!!) are > costly. Is there any better way to implement shuffle?
You can use mutable arrays (modules Data.Array.MArray, Data.Array.IO). Best regards, Tomasz _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
