[Haskell-cafe] Function to detect duplicates

Casey Hawthorne caseyh at istar.ca
Wed Feb 24 17:32:37 EST 2010

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,


More information about the Haskell-Cafe mailing list