News for hackers. Stuff that matters.
Re:Neat data structure: "Ullman" set by abecedarius on Sunday January 18, 2009 @04:20AM (#439227)
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.
Re:Neat data structure: "Ullman" set by fauigerzigerk on Sunday January 18, 2009 @06:55AM (#439275)
Yes you're right. Thanks.