On Tue, 23 Feb 2010 08:30:18 -0300, you wrote: >Hi folks, > >While solving a puzzle, I was posed the problem of finding if there was no >duplicates on a list.
Must it be a list data structure(DS) or list ADT? Mergesort can be parallelized. > >Best regards, > >Rafael -- Regards, Casey _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
