Skip to content

Comment on Neat data structure: "Ullman" set

Comments

It seems to me the probability of a false positive membership test is non-zero.

No, it's correct -- you can see that by induction on the add operation. If you're allowed to increase n without first ensuring the invariant on the first n members, then it can break, yes.

Yes you're right. Thanks.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.