Using Linq, would this be what you would call too easy?

myListOfStrings.Distinct();

The lack of constraints make this problem really simple.

F#:

let strings = [ "put"; "strings"; "here"; ...... ]
let noDups = strings |> Set.of_list |> Set.to_list

Sorted

Aaron,

The Set functionality in F# is really quick. Behind the scenes it uses a tree to filter out duplicates, so for each item it adds/filters it’d cost O(logN)? Converting back to a list is obviously O(n).

For massive lists it wouldn’t be that fantastic, but you’ll find that the implementation is surprisingly quick as F#’s guts have been optimised quite well.

Cheers.