Finding unique elements of a list

Carsten Schultz carsten@REDACTED
Thu Dec 2 12:10:37 CET 2004

Hi Thomas!

On Thu, Dec 02, 2004 at 02:22:42AM -0800, Thomas Lindgren wrote:
> Here is a straightforward version with good O(.):
> first sort the list, then drop consecutive duplicates.

Please read the original question and also note the existence of
lists:usort :-)

Take care,

Carsten Schultz (2:38, 33:47), FB Mathematik, FU Berlin
PGP/GPG key on the key servers, 
fingerprint on my home page.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: not available
URL: <>

More information about the erlang-questions mailing list