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?
Oleg wrote a great article on implementing the perfect shuffle. with some sample code. http://okmij.org/ftp/Haskell/misc.html#perfect-shuffle -- John Meacham - ârepetae.netâjohnâ _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
