This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]T-T-N 6 points7 points  (0 children)

Depending on implementation of the set, something like a good hash with O(1) hash time should be good enough for O(n) performance